Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A record whose update rule is uniform says exactly what was logged

Proved
TranscendenceTower.UniformityPlatform.record_audit

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

contextdefault-logicformalizationlogicnonmonotonic-reasoning
φ∈En⟺φ∈Cn(Λ≤n)(φ∈L)\varphi \in E_n \quad\Longleftrightarrow\quad \varphi \in \mathrm{Cn}(\Lambda_{\le n}) \qquad (\varphi \in L)φ∈En​⟺φ∈Cn(Λ≤n​)(φ∈L)

A record whose update rule treats all propositions alike says exactly what was logged. Every fact in it is attributable to a revision, and nothing in it is lost silently.

Read the contexts of a lifting schema as the revisions of a record. At revision nnn a set Λn\Lambda_nΛn​ of entries is logged; entries lie in the base language, since they are claims about the world rather than about the record. Write Λ≤n\Lambda_{\le n}Λ≤n​ for the entries logged at or before nnn, let SSS be a fixed update schema with consequents Γ\GammaΓ, and let EnE_nEn​ be an extension of (Λ≤n,S)(\Lambda_{\le n}, S)(Λ≤n​,S).

Four parts.

  1. Audit. If SSS is proposition-uniform and Λ≤n∪Γ\Lambda_{\le n}\cup\GammaΛ≤n​∪Γ is consistent, then a base sentence lies in the extension exactly when it follows from the entries. The update rule contributes nothing about the world.

  2. Attribution. If a base sentence is present at revision nnn and absent at revision mmm, then it follows from the entries logged up to nnn and not from those logged up to mmm. Some entry between the two revisions is therefore necessary for it: no fact appears that no revision accounts for.

  3. No silent loss. For m≤nm \le nm≤n, every base sentence of EmE_mEm​ lies in EnE_nEn​. The record's content about the world only grows.

  4. A monotone schema's extension is not Cn(Λ∪Γ)\mathrm{Cn}(\Lambda \cup \Gamma)Cn(Λ∪Γ). With the tautological base and the single rule a : ⊤a\frac{a\,:\,\top}{a}aa:⊤​, the extension is Cn(∅)\mathrm{Cn}(\emptyset)Cn(∅), which does not contain aaa, while Cn(∅∪{a})\mathrm{Cn}(\emptyset\cup\{a\})Cn(∅∪{a}) does. A monotone rule still carries a prerequisite, and a rule whose prerequisite is never derived never fires.

Part 4 is included because the identity it refutes is the natural bridge between the two halves of this subject, and stating the audit property without it invites the reader to prove it a shorter way that does not work.

What is not assumed. The schema need not be monotone: the practically interesting update rules — carry the previous value forward unless something supersedes it — are covered. The base theory need not be symmetric, which matters, because a log is a specific claim about the world and could never satisfy a symmetry hypothesis. Non-uniqueness of the extension is not an obstacle either: the statement holds of every extension, so what multiple extensions cost is reproducibility rather than auditability.

Limits. Consistency of Λ≤n∪Γ\Lambda_{\le n}\cup\GammaΛ≤n​∪Γ is a hypothesis, and a necessary one: a log that contradicts what the update rule could ever say is a record that proves anything. Context-freeness of the entries is likewise necessary, and so is proposition-uniformity — a schema naming a particular sentence is an assertion in disguise, and it is the assertion rather than the record that would be doing the work.

Preamble
import Definitions.Def_TranscendenceTowerContextUniformity

set_option autoImplicit false

open TranscendenceTower.UniformityPlatform
Formal statement
theorem TranscendenceTower.UniformityPlatform.record_audit (A C : Type) :
    (∀ (T : Set (CForm A C)) (S : Set (Rule A C)) (E : Set (CForm A C)),
        (∀ p ∈ T, IsBase p) → PropUniformRules S →
        Consistent (T ∪ {γ | ∃ r ∈ S, r.conseq = γ}) →
        IsExtension T S E →
        ∀ φ : CForm A C, IsBase φ → (φ ∈ E ↔ φ ∈ Cn T))
    ∧ (∀ (Log : ℕ → Set (CForm A C)) (S : Set (Rule A C))
          (Ext : ℕ → Set (CForm A C)),
        (∀ n, ∀ p ∈ Log n, IsBase p) → PropUniformRules S →
        (∀ n, Consistent ({p | ∃ i ≤ n, p ∈ Log i} ∪ {γ | ∃ r ∈ S, r.conseq = γ})) →
        (∀ n, IsExtension {p | ∃ i ≤ n, p ∈ Log i} S (Ext n)) →
        ∀ (m n : ℕ) (φ : CForm A C), IsBase φ → φ ∈ Ext n → φ ∉ Ext m →
          φ ∈ Cn {p | ∃ i ≤ n, p ∈ Log i} ∧ φ ∉ Cn {p | ∃ i ≤ m, p ∈ Log i})
    ∧ (∀ (Log : ℕ → Set (CForm A C)) (S : Set (Rule A C))
          (Ext : ℕ → Set (CForm A C)),
        (∀ n, ∀ p ∈ Log n, IsBase p) → PropUniformRules S →
        (∀ n, Consistent ({p | ∃ i ≤ n, p ∈ Log i} ∪ {γ | ∃ r ∈ S, r.conseq = γ})) →
        (∀ n, IsExtension {p | ∃ i ≤ n, p ∈ Log i} S (Ext n)) →
        ∀ m n : ℕ, m ≤ n → ∀ φ : CForm A C, IsBase φ → φ ∈ Ext m → φ ∈ Ext n)
    ∧ (∀ a : A, ∃ (S : Set (Rule A C)) (E : Set (CForm A C)),
        Monotone S ∧ IsExtension (∅ : Set (CForm A C)) S E ∧
          E ≠ Cn ((∅ : Set (CForm A C)) ∪ {γ | ∃ r ∈ S, r.conseq = γ})) := by sorry
Source
Mateo Estrada, Uniformity and Transcendence: a trichotomy for lifting schemas in the logic of context, 8 September 2026, Section 6 (Records): Theorem 25 (Audit), Corollary 26 (Attribution), Corollary 27 (No silent loss), and Remark 6 (Prerequisites).

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