Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Monotone proposition-uniform lifting schemas are conservative

Proved
TranscendenceTower.UniformityPlatform.uniformity_monotone_dichotomy

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

contextdefault-logicformalizationlogicnonmonotonic-reasoning
T⊆L context-free,Γ proposition-uniform,T∪Γ consistent  ⟹  Cn(T∪Γ)∩L=Cn(T)∩L.T\subseteq L \ \text{context-free},\quad \Gamma \ \text{proposition-uniform},\quad T\cup\Gamma \ \text{consistent} \;\Longrightarrow\; \mathrm{Cn}(T\cup\Gamma)\cap L=\mathrm{Cn}(T)\cap L .T⊆L context-free,Γ proposition-uniform,T∪Γ consistent⟹Cn(T∪Γ)∩L=Cn(T)∩L.

A monotone lifting schema that treats all propositions alike proves no new sentence of the base language. Uniformity and novelty are incompatible, and already in the monotone case, where the extension is unique automatically.

Four parts.

  1. The dichotomy. If the base theory TTT contains no context machinery and the schema's consequents Γ\GammaΓ are closed under substitution, then either T∪ΓT\cup\GammaT∪Γ is inconsistent or every base sentence it proves was already a consequence of TTT.

  2. Conservativity. The same statement as an equality of sets: the extension meets the base language in exactly the base consequences of TTT.

  3. The copy schema is proposition-uniform. Its consequents are the sentences istc(p)→p\mathrm{ist}_c(p)\to pistc​(p)→p, and substituting inside one produces another.

  4. The copy schema is consistent, witnessed by the canonical valuation in which istc(p)\mathrm{ist}_c(p)istc​(p) says exactly what ppp says.

Parts 3 and 4 are not decoration. Without them the dichotomy could hold vacuously, constraining an empty class of schemas; together they exhibit the intended example satisfying every hypothesis.

The informal claim being made precise is that a rule earns the name rule by being indifferent to which proposition it lifts, and that this indifference is exactly what prevents it from delivering a particular new fact. If it delivers φ\varphiφ, then under substitution it must deliver every substitution instance of φ\varphiφ, and those are jointly unsatisfiable whenever φ\varphiφ is not already forced.

Limits. The result is about monotone schemas; the defeasible case needs the trichotomy, where uniqueness can fail instead. Context-freeness of TTT is essential and not a technicality: a base theory that already speaks of contexts can supply a premise the schema exports, and non-conservativity then follows for reasons having nothing to do with lifting. Nothing here says a lifting schema is useless — it says that whatever content one carries must come from somewhere other than its uniformity.

Preamble
import Definitions.Def_TranscendenceTowerContextUniformity

set_option autoImplicit false

open TranscendenceTower.UniformityPlatform
Formal statement
theorem TranscendenceTower.UniformityPlatform.uniformity_monotone_dichotomy (A C : Type) :
    (∀ T Γ : Set (CForm A C), (∀ p ∈ T, IsBase p) → PropUniform Γ →
        Consistent (T ∪ Γ) →
        ∀ φ : CForm A C, IsBase φ → φ ∈ Cn (T ∪ Γ) → φ ∈ Cn T)
    ∧ (∀ T Γ : Set (CForm A C), (∀ p ∈ T, IsBase p) → PropUniform Γ →
        Consistent (T ∪ Γ) →
        {φ : CForm A C | IsBase φ ∧ φ ∈ Cn (T ∪ Γ)}
          = {φ : CForm A C | IsBase φ ∧ φ ∈ Cn T})
    ∧ PropUniform (copySchema A C)
    ∧ (∀ atomv : A → Bool, Models (copySchema A C) (canonVal atomv)) := by sorry
Source
Mateo Estrada, Uniformity and Transcendence: a trichotomy for lifting schemas in the logic of context, 8 September 2026, Theorem 15 (Monotone dichotomy), Section 3.

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