A context-uniform schema has a shift-invariant extension
ProvedTranscendenceTower.UniformityPlatform.uniformity_rigidityIf 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.
-
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.
-
The consequence for levels. Invariance says belongs to the extension exactly when does, where is the shift.
-
The consequence on the base language. There acts as the identity, so the equivalence reads : about the world, the levels say literally the same thing.
-
A monotone schema has at most one consistent extension. When every justification is the consistency test never fails, the stages stop depending on the candidate, and the fixed point is forced.
-
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 itself contains an occurrence of , since the shift relabels the context indices inside 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.
import Definitions.Def_TranscendenceTowerContextUniformity set_option autoImplicit false open TranscendenceTower.UniformityPlatform
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