determined by singles and pairs
ProvedAPFPaper5.K3.Connections.determined_by_singles_and_pairsapfapf-referencepullbacks-v46-2026-11
Result: determined by singles and pairs. All parameters and hypotheses are retained in the declaration below.
theorem determined_by_singles_and_pairs (W W' : ι → ι → ℝ) (hW : IsSymm W) (hW' : IsSymm W')
(h1 : ∀ i, read W (alt i) = read W' (alt i))
(h2 : ∀ i j, i ≠ j →
read W (fun a => alt i a + alt j a) = read W' (fun a => alt i a + alt j a)) :
W = W'
Module context and limits: For a supplied finite real table, single basis reads fix its diagonal and symmetric pair reads determine the remaining entries. A quadratic bill on the unit circle is flat exactly when its cross price is zero; positive cross price fixes the minimizing table, not a unique signed vector. These are algebraic table and circle results, not constructed physical states, chances, or prices.
Source scope parameters:
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
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_APFPaper5_K3_free_number_on_each_connection_Vocabulary import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Data.Real.Basic import Mathlib.Tactic.Ring import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Positivity.Basic import Mathlib.Algebra.Order.Ring.Cast set_option autoImplicit false universe apfNative_u_1
Formal statement
theorem APFPaper5.K3.Connections.determined_by_singles_and_pairs :
∀ {ι : Type apfNative_u_1} [inst : Fintype.{apfNative_u_1} ι] [inst_1 : DecidableEq.{apfNative_u_1 + 1} ι]
(W W' : ι → ι → Real) (hW : @APFPaper5.K3.Connections.IsSymm.{apfNative_u_1} ι W)
(hW' : @APFPaper5.K3.Connections.IsSymm.{apfNative_u_1} ι W')
(h1 :
∀ (i : ι),
@Eq.{1} Real
(@APFPaper5.K3.Connections.read.{apfNative_u_1} ι inst W
(@APFPaper5.K3.Connections.alt.{apfNative_u_1} ι inst_1 i))
(@APFPaper5.K3.Connections.read.{apfNative_u_1} ι inst W'
(@APFPaper5.K3.Connections.alt.{apfNative_u_1} ι inst_1 i)))
(h2 :
∀ (i j : ι),
@Ne.{apfNative_u_1 + 1} ι i j →
@Eq.{1} Real
(@APFPaper5.K3.Connections.read.{apfNative_u_1} ι inst W fun (a : ι) =>
@HAdd.hAdd.{0, 0, 0} Real Real Real (@instHAdd.{0} Real Real.instAdd)
(@APFPaper5.K3.Connections.alt.{apfNative_u_1} ι inst_1 i a)
(@APFPaper5.K3.Connections.alt.{apfNative_u_1} ι inst_1 j a))
(@APFPaper5.K3.Connections.read.{apfNative_u_1} ι inst W' fun (a : ι) =>
@HAdd.hAdd.{0, 0, 0} Real Real Real (@instHAdd.{0} Real Real.instAdd)
(@APFPaper5.K3.Connections.alt.{apfNative_u_1} ι inst_1 i a)
(@APFPaper5.K3.Connections.alt.{apfNative_u_1} ι inst_1 j a))),
@Eq.{apfNative_u_1 + 1} (ι → ι → Real) W W' := by sorry
Source
['Theorems.Thm_APFPaper5_K3_free_number_on_each_connection:239; pullbacks v46; source SHA-256 9a7e70cb6a988b5fe9640fbbbd2eb2106425cc5f870aa5a31e48706f7f67de9d']