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

Small profiles of finite presentations

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

    Initial and root profiles observe the reachable restriction of a finite presentation. Their small versions range over a finite set when every sort of the observing algebra is finite. Every contextual class also has a reachable representative.

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

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

    Lean source view on GitHub

    1import Lax369799.FiniteMorphisms
    2import Lax369799.SyntacticAlgebraTheorems
    3
    4/-!
    5---
    6title: Small profiles of finite presentations
    7type: theorem
    8---
    9Initial and root profiles observe the reachable restriction of a finite
    10presentation. Their small versions range over a finite set when every
    11sort of the observing algebra is finite. Every contextual class also has
    12a reachable representative.
    13-/
    14namespace Lax369799.FiniteProfiles
    15open RankedSystems (RankedSet RankwiseFinite)
    16open FinitePresentations FiniteContextualOrder FiniteAcceptance
    17
    18def SmallProfileEquivalent {A B : RankedSet}
    19 (ρ : ∀ n, RankedSystems.System A n → B n) {n : ℕ} (S T : FiniteSystem A n) : Prop :=
    20 Resolutions.SmallProfileEquivalent ρ (RankedSystems.trim S.graph) (RankedSystems.trim T.graph)
    21
    22axiom small_profile_finite {A B : RankedSet} (hB : RankwiseFinite B)
    23 (ρ : ∀ n, RankedSystems.System A n → B n) (n : ℕ) :
    24 Finite (Quot (@SmallProfileEquivalent A B ρ n))
    25
    26/-- A bound independent of the algebra permits an additional identity continuation. -/
    27def BoundedProfile {A B : RankedSet} (bound : ℕ)
    28 (ρ : ∀ n, RankedSystems.System A n → B n) {n : ℕ}
    29 (S : RankedSystems.SetSystem A n) : Set (Resolutions.ProfileEntry B n) :=
    30 {e | e ∈ Resolutions.Profile ρ S ∧ ∀ j, Nat.card {i // e.2.2 i = j} ≤ bound}
    31
    32def BoundedProfileEquivalent {A B : RankedSet} (bound : ℕ)
    33 (ρ : ∀ n, RankedSystems.System A n → B n) {n : ℕ} (S T : FiniteSystem A n) : Prop :=
    34 BoundedProfile bound ρ (RankedSystems.trim S.graph) =
    35 BoundedProfile bound ρ (RankedSystems.trim T.graph) ∧
    36 BoundedProfile bound ρ (RankedSystems.uproot (RankedSystems.trim S.graph)) =
    37 BoundedProfile bound ρ (RankedSystems.uproot (RankedSystems.trim T.graph))
    38
    39axiom bounded_profile_finite {A B : RankedSet} (hB : RankwiseFinite B) (bound : ℕ)
    40 (ρ : ∀ n, RankedSystems.System A n → B n) (n : ℕ) :
    41 Finite (Quot (@BoundedProfileEquivalent A B bound ρ n))
    42
    43axiom reachable_representative {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    44 (a : Carrier (Accepting L) n) :
    45 ∃ S : RankedSystems.SetSystem A n, quotientMap (Accepting L) n (ofSetSystem S) = a
    46
    47end Lax369799.FiniteProfiles
    48
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…