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

Bounded optimal flatten-resolutions

Lax369799.OptimalResolutions · concepts/Lax369799/OptimalResolutions.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

    Every closed flatten-resolution can be replaced by one whose variable-map fibres have at most |B₁|+1 elements, preserving the value of its flattening in an unfold-invariant observing algebra. The additional observation retains identity continuations at direct hole loops. Only the unary sort needs to be finite for this step.

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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ContextSmallification
    2import Lax369799.ResolutionCompression
    3
    4/-!
    5---
    6title: Bounded optimal flatten-resolutions
    7type: theorem
    8---
    9Every closed flatten-resolution can be replaced by one whose variable-map
    10fibres have at most |B₁|+1 elements, preserving the value of its flattening
    11in an unfold-invariant observing algebra. The additional observation
    12retains identity continuations at direct hole loops. Only the unary sort
    13needs to be finite for this step.
    14-/
    15namespace Lax369799.OptimalResolutions
    16open RankedSystems Flattening Resolutions Algebras
    17
    18def BoundedMap {m n : ℕ} (bound : ℕ) (σ : Fin m → Fin n) : Prop :=
    19 ∀ j, Nat.card {i // σ i = j} ≤ bound
    20
    21axiom optimal_flatten_resolution {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    22 [Finite (B 1)] (η : RankedMap A B) (S : SetSystem (SetSystem A) 0)
    23 (T : System (System A) 0) (r : FlattenResolution S T)
    24 (R : System A 0) (hR : SystemFlattening T R) :
    25 ∃ (U : System (System A) 0) (V : System A 0) (r' : FlattenResolution S U),
    26 SystemFlattening U V ∧
    27 (∀ v, BoundedMap (Nat.card (B 1) + 1) (r'.variableMap v)) ∧
    28 E.eval 0 (relabelSystem η R) = E.eval 0 (relabelSystem η V)
    29
    30end Lax369799.OptimalResolutions
    31
    Show Proof

    Discussion

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

    Loading discussion…