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

Flattening, resolutions, and yield congruence

Lax369799.FlatteningTheorems · concepts/Lax369799/FlatteningTheorems.lean · lax-369799

proven

Loading review…

Sign in with ORCID

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

    Flattening preserves systems. Flatten-resolutions give direct resolutions of a flattening; conversely, every direct resolution has an unfolding obtained by flattening a flatten-resolution. Yield inclusion is preserved by substitution into contexts. These are the central compositional results of Sections 2.6–2.9.

    Concept map
    6 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.Resolutions
    2
    3/-!
    4---
    5title: Flattening, resolutions, and yield congruence
    6type: theorem
    7---
    8Flattening preserves systems. Flatten-resolutions give direct resolutions
    9of a flattening; conversely, every direct resolution has an unfolding
    10obtained by flattening a flatten-resolution. Yield inclusion is preserved
    11by substitution into contexts. These are the central compositional results
    12of Sections 2.6–2.9.
    13-/
    14
    15namespace Lax369799.FlatteningTheorems
    16open RankedSystems Morphisms Flattening Resolutions
    17
    18axiom atomic_flatten_cover {A : RankedSet} {n : ℕ} (S : SetSystem A n) :
    19 UnfoldsTo S (flatten (relabel (fun _ a => atomic a) S))
    20
    21axiom outer_atomic_cover {A : RankedSet} {n : ℕ} (S : SetSystem A n) :
    22 UnfoldsTo S (flatten (atomic S))
    23
    24axiom flatten_system {A : RankedSet} {n : ℕ} (S : System (System A) n) :
    25 ∃ T : System A n, SystemFlattening S T
    26
    27axiom flatten_resolution_sound {A : RankedSet} {n : ℕ}
    28 (S : SetSystem (SetSystem A) n) (T : System (System A) n)
    29 (h : FlattenResolution S T) (U : System A n) (hU : SystemFlattening T U) :
    30 DirectResolution (flatten S) U
    31
    32axiom resolution_to_flatten_resolution {A : RankedSet} {n : ℕ}
    33 (S : SetSystem (SetSystem A) n) (R : System A n)
    34 (hR : DirectResolution (flatten S) R) :
    35 ∃ (T : System (System A) n) (U : System A n),
    36 Nonempty (FlattenResolution S T) ∧ SystemFlattening T U ∧ UnfoldsTo R.val U.val
    37
    38axiom yield_context_congruence {A : RankedSet} {k n : ℕ}
    39 (C : SetContext A k n) (S T : SetSystem A k) (h : YieldBelow S T) :
    40 YieldBelow (plug C S) (plug C T)
    41
    42axiom unfold_context_congruence {A : RankedSet} {k n : ℕ}
    43 (C : SetContext A k n) (S T : SetSystem A k) (h : UnfoldEquivalent S T) :
    44 UnfoldEquivalent (plug C S) (plug C T)
    45
    46end Lax369799.FlatteningTheorems
    47
    Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…