turning a held side over costs the floor
ProvedAPFPaper1.FreeWays.turning_a_held_side_over_costs_the_floorapfapf-referencepullbacks-v46-2026-11
Result: turning a held side over costs the floor. All parameters and hypotheses are retained in the declaration below.
theorem turning_a_held_side_over_costs_the_floor (hId : Identity Conn) (hC : Concat Conn)
(hN : NarrowFloor (carried reads) Conn eps) {g : Ctx} {A B : Alignment reads g} {s : ℝ}
(h : Chain Conn ⟨g, A⟩ ⟨g, B⟩ s) {d : Dn g} (hd : d ∈ A.1.2) (hfalse : reads g d B.1.1 = false) :
eps g ≤ s
Module context and limits: NarrowFloor is a supplied condition on a held-content map and connection relation. With Identity and cross-context Concat it fixes held content along free chains; guarded unique minimization additionally fixes a minimum. A model distinguishes it from the wide Floor. No converse that unchanged holdings imply free motion, physical adoption, or release mechanism is claimed.
Source scope parameters:
universe u v w
variable {Ctx : Type u} {Al : Ctx → Type v} {Hd : Ctx → Type w}
variable {held : (g : Ctx) → Al g → Hd g} {Conn : Place Al → Place Al → ℝ → Prop} {eps : Ctx → ℝ}
variable {Ctx : Type u} {Cfg : Ctx → Type v} {Dn : Ctx → Type w}
variable {reads : (g : Ctx) → Dn g → Cfg g → Bool}
{Conn : Place (Alignment reads) → Place (Alignment reads) → ℝ → Prop} {eps : Ctx → ℝ}
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_the_narrow_floor_Vocabulary import Definitions.Def_APFB06_two_context_world_has_no_per_realignment_floor_Vocabulary import Theorems.Thm_APFB06_TwoContextWorld_kept_wAwayAndBack import Theorems.Thm_APFB06_TwoContextWorld_kept_wTurnTwice import Theorems.Thm_APFB06_TwoContextWorld_away_and_back_turns_the_side_over import Theorems.Thm_APFB06_TwoContextWorld_turning_twice_turns_the_side_over import Theorems.Thm_APFB06_TwoContextWorld_a_free_way_turns_the_side_over import Theorems.Thm_APFB06_TwoContextWorld_two_free_turns_turn_the_side_over import Theorems.Thm_APFB06_TwoContextWorld_two_context_world_has_no_per_realignment_floor import Definitions.Def_APFB07b_unique_minimum_where_no_tie_Vocabulary import Theorems.Thm_APFB07b_bwWhere_true_iff import Theorems.Thm_APFB07b_bwWhere_of_bw import Theorems.Thm_APFB07b_not_generic_of_two_minima import Theorems.Thm_APFB07b_unique_fewest_of_generic import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum set_option autoImplicit false universe apfNative_u apfNative_v apfNative_w
Formal statement
theorem APFPaper1.FreeWays.turning_a_held_side_over_costs_the_floor :
∀ {Ctx : Type apfNative_u} {Cfg : Ctx → Type apfNative_v} {Dn : Ctx → Type apfNative_w}
{reads : (g : Ctx) → Dn g → Cfg g → Bool}
{Conn :
@APFPaper1.FreeWays.Place.{apfNative_u, max apfNative_w apfNative_v} Ctx
(@APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads) →
@APFPaper1.FreeWays.Place.{apfNative_u, max apfNative_w apfNative_v} Ctx
(@APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads) →
Real → Prop}
{eps : Ctx → Real}
(hId :
@APFPaper1.FreeWays.Identity.{apfNative_u, max apfNative_v apfNative_w} Ctx
(@APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads) Conn)
(hC :
@APFPaper1.FreeWays.Concat.{apfNative_u, max apfNative_v apfNative_w} Ctx
(@APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads) Conn)
(hN :
@APFPaper1.FreeWays.NarrowFloor.{apfNative_u, max apfNative_v apfNative_w, apfNative_w} Ctx
(@APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads)
(fun (g : Ctx) => Set.{apfNative_w} (Dn g))
(@APFPaper1.FreeWays.carried.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads) Conn eps)
{g : Ctx} {A B : @APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads g} {s : Real}
(h :
@APFPaper1.FreeWays.Chain.{apfNative_u, max apfNative_v apfNative_w} Ctx
(@APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads) Conn
(@Sigma.mk.{apfNative_u, max apfNative_v apfNative_w} Ctx
(@APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads) g A)
(@Sigma.mk.{apfNative_u, max apfNative_v apfNative_w} Ctx
(@APFPaper1.FreeWays.Alignment.{apfNative_u, apfNative_v, apfNative_w} Ctx Cfg Dn reads) g B)
s)
{d : Dn g}
(hd :
@Membership.mem.{apfNative_w, apfNative_w} (Dn g) (Set.{apfNative_w} (Dn g))
(@Set.instMembership.{apfNative_w} (Dn g))
(@Prod.snd.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g))
(@Subtype.val.{max (apfNative_v + 1) (apfNative_w + 1)}
(Prod.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g)))
(fun (p : Prod.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g))) =>
∀ (d : Dn g),
@Membership.mem.{apfNative_w, apfNative_w} (Dn g) (Set.{apfNative_w} (Dn g))
(@Set.instMembership.{apfNative_w} (Dn g))
(@Prod.snd.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g)) p) d →
@Eq.{1} Bool (reads g d (@Prod.fst.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g)) p))
Bool.true)
A))
d)
(hfalse :
@Eq.{1} Bool
(reads g d
(@Prod.fst.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g))
(@Subtype.val.{max (apfNative_v + 1) (apfNative_w + 1)}
(Prod.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g)))
(fun (p : Prod.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g))) =>
∀ (d : Dn g),
@Membership.mem.{apfNative_w, apfNative_w} (Dn g) (Set.{apfNative_w} (Dn g))
(@Set.instMembership.{apfNative_w} (Dn g))
(@Prod.snd.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g)) p) d →
@Eq.{1} Bool (reads g d (@Prod.fst.{apfNative_v, apfNative_w} (Cfg g) (Set.{apfNative_w} (Dn g)) p))
Bool.true)
B)))
Bool.false),
@LE.le.{0} Real Real.instLE (eps g) s := by sorry
Source
['Theorems.Thm_APFPaper1_the_narrow_floor:170; pullbacks v46; source SHA-256 27e0ac447161b859d9cb18d16e29437c93e3c0ce853c1cdfdad89c87bdf8c9d6']