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

Finite families of split-variable resolutions

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

    A bounded profile can be represented by finitely many actual resolutions, retaining each resolution's variable map. A rank-n representative needs only resolutions of rank at most n times the fibre bound. In particular, unary representatives may require multi-variable resolutions; these are retained rather than replaced by unary branches.

    Concept map
    17 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.FiniteProfiles
    2
    3/-!
    4---
    5title: Finite families of split-variable resolutions
    6type: theorem
    7---
    8A bounded profile can be represented by finitely many actual resolutions,
    9retaining each resolution's variable map. A rank-n representative needs
    10only resolutions of rank at most n times the fibre bound. In particular,
    11unary representatives may require multi-variable resolutions; these are
    12retained rather than replaced by unary branches.
    13-/
    14namespace Lax369799.ResolutionFamilies
    15open RankedSystems Resolutions FiniteProfiles
    16
    17structure Witness {A : RankedSet} {n : ℕ} (S : SetSystem A n) where
    18 arity : ℕ
    19 system : System A arity
    20 variableMap : Fin arity → Fin n
    21 resolves : IsResolution S system variableMap
    22
    23def Witness.entry {A B : RankedSet} (ρ : ∀ n, System A n → B n) {n : ℕ}
    24 {S : SetSystem A n} (w : Witness S) : ProfileEntry B n :=
    25 ⟨w.arity, ρ w.arity w.system, w.variableMap⟩
    26
    27axiom finite_family {A B : RankedSet} (hB : RankwiseFinite B) (bound : ℕ)
    28 (ρ : ∀ n, System A n → B n) {n : ℕ} (S : SetSystem A n) :
    29 ∃ (k : ℕ) (w : Fin k → Witness S),
    30 (∀ i, (w i).arity ≤ n * bound) ∧
    31 BoundedProfile bound ρ S = Set.range (fun i => (w i).entry ρ)
    32
    33end Lax369799.ResolutionFamilies
    34
    Show Proof

    Discussion

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

    Loading discussion…