Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Invariance and characterization of GAME

Lax535992.GameInvariance · concepts/Lax535992/GameInvariance.lean · lax-535992

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

    Lemma

    Having a winning starting position is invariant under isomorphism of and-or graphs, and an and-or graph is a yes-instance of GAME exactly when some starting position is winning.

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

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

    1 game_iff proven

    2 gameWon_iso 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 Lax904597.Machines
    8import Lax485149.Problems
    9import Lax485149.Complement
    10import Lax485149.SecondOrderAtoms
    11import Lax485149.TransitiveClosure
    12import Lax485149.DeterministicTransitiveClosure
    13import Lax485149.ClassNL
    14import Lax485149.ClassL
    15import Lax535992.HornFragment
    16import Lax535992.LeastFixedPoint
    17import Lax535992.InflationaryFixedPoint
    18import Lax535992.HornSat
    19import Lax535992.CircuitValue
    20import Lax535992.Game
    21import Lax535992.DeterministicMachines
    22import Lax535992.ClassPTIME
    23
    24/-!
    25---
    26title: Invariance and characterization of GAME
    27type: lemma
    28---
    29Having a winning starting position is invariant under isomorphism of and-or
    30graphs, and an and-or graph is a yes-instance of GAME exactly when some
    31starting position is winning.
    32-/
    33
    34namespace Lax535992.GameInvariance
    35
    36open FirstOrder FirstOrder.Language
    37open Lax904597.Problems Lax904597.Interpretations Lax904597.Relativized Lax904597.SecondOrder
    38open Lax904597.Classes Lax904597.Sat Lax904597.Machines
    39open Lax485149.Problems Lax485149.Complement Lax485149.SecondOrderAtoms
    40open Lax485149.TransitiveClosure Lax485149.DeterministicTransitiveClosure
    41open Lax485149.ClassNL Lax485149.ClassL
    42open Lax535992.HornFragment Lax535992.LeastFixedPoint Lax535992.InflationaryFixedPoint
    43open Lax535992.HornSat Lax535992.CircuitValue Lax535992.Game Lax535992.DeterministicMachines
    44open Lax535992.ClassPTIME
    45
    46/-- Having a winning starting position is isomorphism-invariant. -/
    47axiom gameWon_iso : ∀ {A B : Type} [andOrGraph.Structure A] [andOrGraph.Structure B],
    48 (A ≃[andOrGraph] B) → (GameWon A ↔ GameWon B)
    49
    50/-- The yes-instances of GAME are exactly the instances with the defining
    51property. -/
    52axiom game_iff : ∀ (A : Type) [andOrGraph.Structure A], GAME A ↔ GameWon A
    53
    54end Lax535992.GameInvariance
    55
    Show 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…