priced ways meet the laws
ProvedAPFPaper1.FreeWays.priced_ways_meet_the_lawsapfapf-referencepullbacks-v46-2026-11
Result: priced ways meet the laws. All parameters and hypotheses are retained in the declaration below.
theorem priced_ways_meet_the_laws (e : ℝ) (he : 0 < e) :
Identity (PricedConn (Al := Al) e) ∧ Concat (PricedConn (Al := Al) e) ∧
Floor (PricedConn (Al := Al) e) (fun _ => e) ∧
∀ p q : Place Al, PricedConn e p q e ∧ PricedConn e q p e
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.priced_ways_meet_the_laws :
∀ {Ctx : Type apfNative_u} {Al : Ctx → Type apfNative_v} (e : Real)
(he : @LT.lt.{0} Real Real.instLT (@OfNat.ofNat.{0} Real (nat_lit 0) (@Zero.toOfNat0.{0} Real Real.instZero)) e),
And
(@APFPaper1.FreeWays.Identity.{apfNative_u, apfNative_v} Ctx Al
(@APFPaper1.FreeWays.PricedConn.{apfNative_u, apfNative_v} Ctx Al e))
(And
(@APFPaper1.FreeWays.Concat.{apfNative_u, apfNative_v} Ctx Al
(@APFPaper1.FreeWays.PricedConn.{apfNative_u, apfNative_v} Ctx Al e))
(And
(@APFPaper1.FreeWays.Floor.{apfNative_u, apfNative_v} Ctx Al
(@APFPaper1.FreeWays.PricedConn.{apfNative_u, apfNative_v} Ctx Al e) fun (x : Ctx) => e)
(∀ (p q : @APFPaper1.FreeWays.Place.{apfNative_u, apfNative_v} Ctx Al),
And (@APFPaper1.FreeWays.PricedConn.{apfNative_u, apfNative_v} Ctx Al e p q e)
(@APFPaper1.FreeWays.PricedConn.{apfNative_u, apfNative_v} Ctx Al e q p e)))) := by sorry
Source
['Theorems.Thm_APFPaper1_free_ways_under_the_per_realignment_floor:224; pullbacks v46; source SHA-256 529f30c5a3bf2cde9840cd61eb28752149341bafeb1b37a568e95251a8592976']