Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A context-uniform schema has a shift-invariant extension

Proved
TranscendenceTower.UniformityPlatform.uniformity_rigidity

by mateoej12 · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

contextdefault-logicformalizationlogicnonmonotonic-reasoning
σ−1(E)=E,henceistc(φ)∈E  ⟺  istout(c)(σφ)∈E.\sigma^{-1}(E)=E, \qquad\text{hence}\qquad \mathrm{ist}_c(\varphi)\in E \iff \mathrm{ist}_{\mathrm{out}(c)}(\sigma\varphi)\in E .σ−1(E)=E,henceistc​(φ)∈E⟺istout(c)​(σφ)∈E.

If a lifting schema treats the contexts uniformly — it is its own preimage under the shift — then its unique consistent extension is shift-invariant, and every level of the tower carries the same content as every other.

Five parts.

  1. Rigidity. For a context-free base theory and a schema preserved by the shift, if the extension is consistent and unique then it is shift-invariant.

  2. The consequence for levels. Invariance says istc(φ)\mathrm{ist}_c(\varphi)istc​(φ) belongs to the extension exactly when istout(c)(σφ)\mathrm{ist}_{\mathrm{out}(c)}(\sigma\varphi)istout(c)​(σφ) does, where σ\sigmaσ is the shift.

  3. The consequence on the base language. There σ\sigmaσ acts as the identity, so the equivalence reads istc(φ)∈E  ⟺  istout(c)(φ)∈E\mathrm{ist}_c(\varphi)\in E \iff \mathrm{ist}_{\mathrm{out}(c)}(\varphi)\in Eistc​(φ)∈E⟺istout(c)​(φ)∈E: about the world, the levels say literally the same thing.

  4. A monotone schema has at most one consistent extension. When every justification is ⊤\top⊤ the consistency test never fails, the stages stop depending on the candidate, and the fixed point is forced.

  5. The copy schema illustrates the hypotheses. What is stated formally is that the union of its stages over the empty theory is shift-invariant. Because the copy schema is monotone, the justification check never fails and that union is its extension, which part 4 makes unique; the copy schema is also consistent, witnessed by the canonical valuation. Those two facts are not asserted in this statement, so part 5 illustrates the hypotheses of part 1 rather than discharging all of them.

The reading is that inertness, not novelty, is what uniform treatment of contexts delivers — and that this is a guarantee rather than a defect wherever the requirement is the absence of drift: persistent records, audit trails, any setting in which a commitment made earlier must still mean the same thing later.

Limits. The shift must carry the right-hand side of part 2; dropping it, as one is tempted to, gives a false statement as soon as φ\varphiφ itself contains an occurrence of ist\mathrm{ist}ist, since the shift relabels the context indices inside φ\varphiφ too. Only on the base language, part 3, is the unshifted form correct. The frame map is required to be a bijection rather than merely a total injection; see the explanation for exactly where surjectivity is used. Nothing here decides the merely injective case.

Preamble
import Definitions.Def_TranscendenceTowerContextUniformity

set_option autoImplicit false

open TranscendenceTower.UniformityPlatform
Formal statement
theorem TranscendenceTower.UniformityPlatform.uniformity_rigidity (A C : Type) :
    (∀ (oc : C ≃ C) (T : Set (CForm A C)) (S : Set (Rule A C))
        (E : Set (CForm A C)),
        (∀ p ∈ T, IsBase p) →
        (shiftAut (A := A) oc).preRules S = S →
        IsExtension T S E → Consistent E →
        (∀ E', IsExtension T S E' → Consistent E' → E' = E) →
        (shiftAut (A := A) oc).pre E = E)
    ∧ (∀ (oc : C ≃ C) (E : Set (CForm A C)),
        (shiftAut (A := A) oc).pre E = E →
        ∀ (c : C) (φ : CForm A C),
          (CForm.ist c φ ∈ E ↔ CForm.ist (oc c) (shift oc φ) ∈ E))
    ∧ (∀ (oc : C ≃ C) (E : Set (CForm A C)),
        (shiftAut (A := A) oc).pre E = E →
        ∀ (c : C) (φ : CForm A C), IsBase φ →
          (CForm.ist c φ ∈ E ↔ CForm.ist (oc c) φ ∈ E))
    ∧ (∀ (T : Set (CForm A C)) (S : Set (Rule A C)), Monotone S →
        ∀ E E' : Set (CForm A C),
          IsExtension T S E → Consistent E →
          IsExtension T S E' → Consistent E' → E' = E)
    ∧ (∀ (oc : C ≃ C) (atomv : A → Bool),
        (shiftAut (A := A) oc).pre
            (⋃ i, stage (∅ : Set (CForm A C)) (copyRules A C) ∅ i)
          = ⋃ i, stage (∅ : Set (CForm A C)) (copyRules A C) ∅ i) := by sorry
Source
Mateo Estrada, Uniformity and Transcendence: a trichotomy for lifting schemas in the logic of context, 8 September 2026, Theorem 21 (Rigidity), Section 5.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me