free reach is single valued when it can return
ProvedAPFPaper1.FreeWays.free_reach_is_single_valued_when_it_can_returnapfapf-referencepullbacks-v46-2026-11
Result: free reach is single valued when it can return. All parameters and hypotheses are retained in the declaration below.
theorem free_reach_is_single_valued_when_it_can_return (hId : Identity Conn) (hC : Concat Conn)
(hF : Floor Conn eps) {p : Place Al} {h : Ctx} {b b' : Al h}
(hback : FreeChain Conn ⟨h, b⟩ p) (h2 : FreeChain Conn p ⟨h, b'⟩) : b = b'
Module context and limits: Identity, unconditional cross-context Concat and a positive Floor on distinct alignments are explicit hypotheses. Under them free chains returning to a context fix its alignment, and reversible free reach is a renaming. Concat is stronger than the paper's conditional admissible-composition clause; these laws are not adopted inputs or assertions of physical connectivity.
Source scope parameters:
universe u v
variable {Ctx : Type u} {Al : Ctx → Type v}
variable {Conn : Place Al → Place Al → ℝ → Prop} {eps : Ctx → ℝ}
variable {Ctx : Type u} {Al : Ctx → Type v}
Public reference result; this record does not establish Foundation admission, physical K1–K4 closure, a forced transfer or Born-rule derivation.
Preamble
import Definitions.Def_APFPaper1_free_ways_under_the_per_realignment_floor_Vocabulary import Mathlib.Data.Real.Basic import Mathlib.Tactic.Linarith set_option autoImplicit false universe apfNative_u apfNative_v
Formal statement
theorem APFPaper1.FreeWays.free_reach_is_single_valued_when_it_can_return :
∀ {Ctx : Type apfNative_u} {Al : Ctx → Type apfNative_v}
{Conn :
@APFPaper1.FreeWays.Place.{apfNative_u, apfNative_v} Ctx Al →
@APFPaper1.FreeWays.Place.{apfNative_u, apfNative_v} Ctx Al → Real → Prop}
{eps : Ctx → Real} (hId : @APFPaper1.FreeWays.Identity.{apfNative_u, apfNative_v} Ctx Al Conn)
(hC : @APFPaper1.FreeWays.Concat.{apfNative_u, apfNative_v} Ctx Al Conn)
(hF : @APFPaper1.FreeWays.Floor.{apfNative_u, apfNative_v} Ctx Al Conn eps)
{p : @APFPaper1.FreeWays.Place.{apfNative_u, apfNative_v} Ctx Al} {h : Ctx} {b b' : Al h}
(hback :
@APFPaper1.FreeWays.FreeChain.{apfNative_u, apfNative_v} Ctx Al Conn
(@Sigma.mk.{apfNative_u, apfNative_v} Ctx Al h b) p)
(h2 :
@APFPaper1.FreeWays.FreeChain.{apfNative_u, apfNative_v} Ctx Al Conn p
(@Sigma.mk.{apfNative_u, apfNative_v} Ctx Al h b')),
@Eq.{apfNative_v + 1} (Al h) b b' := by sorry
Source
['Theorems.Thm_APFPaper1_free_ways_under_the_per_realignment_floor:168; pullbacks v46; source SHA-256 529f30c5a3bf2cde9840cd61eb28752149341bafeb1b37a568e95251a8592976']