Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lifting is route-dependent: a transfer that succeeds directly can fail through an intermediary

Proved
TranscendenceTower.Chaining.lifting_does_not_chain

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

formalizing-contextlogicnonmonotonic-logic

Does lifting compose? If a fact travels from one context to a second, and from the second to a third, does it arrive by the same route it would have taken directly?

It does not, and the reason is structural. Lifting carries a context's assertions across, so a two-step route deposits the intermediate context's own commitments into the destination alongside those of the origin. Those extra commitments can conflict with the destination even when the origin does not.

Take three contexts:

c1⊢p,c2⊢q,c3⊢¬(p∧q).c_1 \vdash p, \qquad c_2 \vdash q, \qquad c_3 \vdash \neg(p \wedge q).c1​⊢p,c2​⊢q,c3​⊢¬(p∧q).

Observe first that c1c_1c1​ and c3c_3c3​ are entirely compatible — ppp and ¬(p∧q)\neg(p \wedge q)¬(p∧q) hold together. There is no conflict between the endpoints.

Directly, ppp transfers to c3c_3c3​ and does so determinately: nothing need be blocked, the empty blocking set is therefore minimal, and ppp is a consequence of the result.

Through c2c_2c2​, it does not. The first hop carries qqq along, so what arrives at c3c_3c3​ is {p,q}\{p, q\}{p,q} rather than {p}\{p\}{p}, and that conflicts. Two incomparable minimal blocking sets appear — give up ppp, or give up qqq — and in the first of them ppp does not survive.

So lifting is route-dependent. The specializes relation composes perfectly well as a relation between contexts, but what it transfers does not compose along with it: which path a fact took is part of what arrived.

This sharpens the multiple-extensions result rather than repeating it. There, indeterminacy arose because the destination genuinely conflicted with the origin, which is unsurprising. Here the origin and destination are compatible, and the indeterminacy is manufactured entirely by passing through an intermediary. A theory of contexts therefore cannot treat specializes as something to be chained freely in order to reach a distant context.

Retired because it is superseded by TranscendenceTower.Chaining.lifting_is_route_sensitive, whose statement makes the intended semantic strength explicit.

Preamble
import Definitions.Def_TranscendenceTowerLiftConflicts

set_option autoImplicit false

open TranscendenceTower TranscendenceTower.ContextTheories TranscendenceTower.Lifting
Formal statement
namespace TranscendenceTower.Chaining

theorem lifting_does_not_chain :
    (MinBlock srcP tgtNand ∅ ∧ pA ∈ Cn (Lift srcP tgtNand ∅))
      ∧ Lift srcP {qA} ∅ = srcPQ
      ∧ MinBlock srcPQ tgtNand {pA}
      ∧ MinBlock srcPQ tgtNand {qA}
      ∧ pA ∉ Cn (Lift srcPQ tgtNand {pA}) := by sorry

end TranscendenceTower.Chaining
Source
Structural question about the specializes/lifting relation of John McCarthy, Notes on Formalizing Context, 1993, Section 4: whether transfer between contexts composes. Semantics as in the accompanying lifting results.

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