Lax Lean Archive

L is closed under first-order reductions

Lax485149.LClosure · concepts/Lax485149/LClosure.lean · lax-485149

proven

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Membership in L travels backward along first-order reductions and along ordered first-order reductions: if a problem reduces to a problem of L, it is in L. Membership reads a problem on its finite instances only: two problems with the same finite yes-instances are both in L or both outside.

    A deterministic walk on the interpreted structure is a deterministic walk on the base structure, the tags carried in the modes.

    Concept map
    20 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 3 statements. Each proof establishes one of them relative to its assumptions.

    1 LOGSPACE_mem_congr_finite proven

    2 LOGSPACE_mem_of_foReduction proven

    3 LOGSPACE_mem_of_orderedReduction proven

    Lean source view on GitHub

    1import Lax904597.Problems
    2import Lax904597.Interpretations
    3import Lax904597.Relativized
    4import Lax904597.SecondOrder
    5import Lax904597.Classes
    6import Lax904597.Sat
    7import Lax485149.Problems
    8import Lax485149.Complement
    9import Lax485149.SecondOrderAtoms
    10import Lax485149.KromFragment
    11import Lax485149.TransitiveClosure
    12import Lax485149.DeterministicTransitiveClosure
    13import Lax485149.FirstOrderDefinability
    14import Lax485149.HeadAutomata
    15import Lax485149.Reachability
    16import Lax485149.DeterministicReachability
    17import Lax485149.TwoSat
    18import Lax485149.ClassNL
    19import Lax485149.ClassL
    20
    21/-!
    22---
    23title: L is closed under first-order reductions
    24type: theorem
    25---
    26Membership in L travels backward along first-order reductions and along
    27ordered first-order reductions: if a problem reduces to a problem of L, it
    28is in L. Membership reads a problem on its finite instances only: two
    29problems with the same finite yes-instances are both in L or both
    30outside.
    31
    32A deterministic walk on the interpreted structure is a deterministic walk on
    33the base structure, the tags carried in the modes.
    34-/
    35
    36namespace Lax485149.LClosure
    37
    38open FirstOrder FirstOrder.Language
    39open Lax904597.Problems Lax904597.Interpretations Lax904597.Relativized Lax904597.SecondOrder
    40open Lax904597.Classes Lax904597.Sat
    41open Lax485149.Problems Lax485149.Complement Lax485149.SecondOrderAtoms Lax485149.KromFragment
    42open Lax485149.TransitiveClosure Lax485149.DeterministicTransitiveClosure
    43open Lax485149.FirstOrderDefinability Lax485149.HeadAutomata Lax485149.Reachability
    44open Lax485149.DeterministicReachability Lax485149.TwoSat Lax485149.ClassNL Lax485149.ClassL
    45
    46/-- Membership in LOGSPACE travels backward along first-order reductions. -/
    47axiom LOGSPACE_mem_of_foReduction : ∀ {L L' : Language.{0, 0}} [L.IsRelational] [L'.IsRelational]
    48 {P : DecisionProblem L} {Q : DecisionProblem L'},
    49 FOReduction P Q → LOGSPACE.Mem Q → LOGSPACE.Mem P
    50
    51/-- Membership in LOGSPACE travels backward along ordered first-order reductions. -/
    52axiom LOGSPACE_mem_of_orderedReduction :
    53 ∀ {L L' : Language.{0, 0}} [L.IsRelational] [L'.IsRelational]
    54 {P : DecisionProblem L} {Q : DecisionProblem L'},
    55 OrderedFOReduction P Q → LOGSPACE.Mem Q → LOGSPACE.Mem P
    56
    57/-- Membership in LOGSPACE only depends on the finite instances of a problem. -/
    58axiom LOGSPACE_mem_congr_finite :
    59 ∀ {L : Language.{0, 0}} [L.IsRelational] {P Q : DecisionProblem L},
    60 (∀ (A : Type) [L.Structure A] [Finite A], P A ↔ Q A) → (LOGSPACE.Mem P ↔ LOGSPACE.Mem Q)
    61
    62end Lax485149.LClosure
    63
    Show ProofShow ProofShow Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…