Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dropping one schema instance destroys uniqueness

Proved
TranscendenceTower.Relaxation.relaxed_not_definitional

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

formalizing-contextlogicnonmonotonic-logic

Let aaa be the assumption to be relaxed, and impose the transcendence schema everywhere except at aaa. Then there are two distinct transcending contexts extending the same base and satisfying every remaining instance: one that keeps the old value of aaa, and one that relaxes it.

Two consequences follow. First, the relaxed tower is not a definitional extension: the new vocabulary is no longer determined by the old, so the argument that stages are conservative because they are definitional does not apply to it. Second, the relaxed schema is nonetheless consistent, since the two witnesses are models of it.

Relaxation is therefore not incoherent, merely underdetermined. What it loses is exactly the property that made the original tower harmless: uniqueness of the extension. And the loss is immediate — dropping a single instance of the schema already suffices, so no weakened form of definitional extension survives partial relaxation.

Preamble
import Definitions.Def_TranscendenceTowerRelaxation

set_option autoImplicit false

open TranscendenceTower
Formal statement
namespace TranscendenceTower.Relaxation

theorem relaxed_not_definitional (v : Atom 0 → Bool) (a : Lang 0) :
    ∃ N₁ N₂ : Atom 1 → Bool,
      ExtendsBase v N₁ ∧ ExtendsBase v N₂ ∧ N₁ ≠ N₂ ∧
      (∀ p : Lang 0, p ≠ a → Form.eval N₁ (schema p) = true) ∧
      (∀ p : Lang 0, p ≠ a → Form.eval N₂ (schema p) = true) := by sorry

end TranscendenceTower.Relaxation
Source
Mateo Estrada, Harmless and Pointless: Consistency, rigidity, and the indeterminacy of context transfer in McCarthy's formalization of context, 7 September 2026, Section 4 (supporting result, not numbered in the paper): dropping one schema instance frees exactly that instance.

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