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

Computable bounds on the syntactic nullary and unary sorts

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

    The number of possible small profile entries is bounded by a finite sum. Initial and root profile codes give a bound on each contextual quotient without computing equivalence of contexts. This is the quantitative step used in the effectivity argument after Theorem 2.

    Concept map
    19 concepts; 4 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.QuantitativeRecognition
    2import Lax369799.FiniteContextualOrder
    3import Lax369799.FiniteAcceptance
    4import Mathlib.Algebra.BigOperators.Group.Finset.Basic
    5
    6/-!
    7---
    8title: Computable bounds on the syntactic nullary and unary sorts
    9type: theorem
    10---
    11The number of possible small profile entries is bounded by a finite sum.
    12Initial and root profile codes give a bound on each contextual quotient
    13without computing equivalence of contexts. This is the quantitative
    14step used in the effectivity argument after Theorem 2.
    15-/
    16
    17namespace Lax369799.QuantitativeProfiles
    18
    19def entryBound (f : ℕ → ℕ) (bound n : ℕ) : ℕ :=
    20 ∑ k ∈ Finset.range (n*bound+1),f k*n^k
    21
    22def quotientBound (f : ℕ → ℕ) (n : ℕ) : ℕ :=
    23 2 ^ (2*entryBound f (f 1+1) n)
    24
    25open RankedSystems Algebras QuantitativeRecognition
    26
    27axiom syntactic_bound {A : RankedSet} (L : Language A) (hL : UnfoldInvariantLanguage L)
    28 (f : ℕ → ℕ) (hrec : Bound f L) (n : ℕ) :
    29 Nat.card (FiniteContextualOrder.Carrier (FiniteAcceptance.Accepting L) n) ≤ quotientBound f n
    30
    31end Lax369799.QuantitativeProfiles
    Show Proof

    Discussion

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

    Loading discussion…