Spectral factorization, Hubbard–Stratonovich acceptance & conditioning, rejection TV bound, and runtime unification for Theorem 4.4
ProvedCritWinSpin.p4c_4_4_mathcritwinspinhelperp4ctheorem_4_4
Pure mathematical and Hubbard–Stratonovich analytical components supporting the reduction from Lemma 4.3 to Theorem 4.4:
Together with spectral cap monotonicity, the criterion when , exact Gibbs conditioning , and runtime unification across the critical-window () and high-temperature () regimes, these isolate all real-analytic and measure-theoretic reasoning from the randomized Turing machine construction.
Preamble
import Mathlib import Definitions.Def_IsingLTL_BeliefProp_TVDist import Definitions.Def_CritWinSpin_Wpot open MeasureTheory IsingLTL.BeliefProp open scoped BigOperators set_option autoImplicit false
Formal statement
namespace CritWinSpin
/-- Pure mathematical components for `CritWinSpin.p4c_theorem_4_4_from_lemma_4_3`: positivity of `tau`,
spectral square-root factorization `J = L * Lᵀ`, spectral upper-bound monotonicity and `δ > 1` criterion,
Hubbard–Stratonovich discrepancy, acceptance lower bound, and Gibbs conditioning from Lemmas 4.1–4.2,
conditional rejection TV bound, `(1 - p)^t ≤ exp(-p * t)`, and unified runtime bound across both regimes. -/
theorem p4c_4_4_math :
(∀ (S : SpinLaw), 0 < tau S) ∧
(∀ {N : ℕ} (J : Matrix (Fin N) (Fin N) ℝ),
J.PosSemidef → ∃ L : Matrix (Fin N) (Fin N) ℝ, L * L.transpose = J) ∧
(∀ {N : ℕ} (J : Matrix (Fin N) (Fin N) ℝ) {s₁ s₂ : ℝ},
(s₁ • (1 : Matrix (Fin N) (Fin N) ℝ) - J).PosSemidef → s₁ ≤ s₂ →
(s₂ • (1 : Matrix (Fin N) (Fin N) ℝ) - J).PosSemidef) ∧
(∀ (S : SpinLaw) {N : ℕ} (J : Matrix (Fin N) (Fin N) ℝ) {δ : ℝ},
((tau S * (1 + δ)) • (1 : Matrix (Fin N) (Fin N) ℝ) - J).PosSemidef →
¬ ((2 * tau S) • (1 : Matrix (Fin N) (Fin N) ℝ) - J).PosSemidef → 1 < δ) ∧
(∀ (S : SpinLaw) (p : ℕ), IsGHS S → IsTypeP S p →
∃ C₄₂ : ℝ, 0 < C₄₂ ∧ ∀ {N : ℕ} (J L : Matrix (Fin N) (Fin N) ℝ) (h : Fin N → ℝ) (s : ℝ),
tau S < s → J.PosSemidef → J = L * L.transpose →
Integrable (fun z : Fin N → ℝ => Real.exp (-Wpot S s L h z)) →
(∀ z : Fin N → ℝ,
0 ≤ hsV S L h z - Wpot S s L h z ∧
hsV S L h z - Wpot S s L h z ≤ (N : ℝ) * (C₄₂ * (s - tau S) ^ ((p : ℝ) / ((p : ℝ) - 1)))) ∧
0 < ∫ z : Fin N → ℝ, Real.exp (-Wpot S s L h z) ∧
Real.exp (-((N : ℝ) * (C₄₂ * (s - tau S) ^ ((p : ℝ) / ((p : ℝ) - 1))))) ≤
1 - ∫ z : Fin N → ℝ, normDens (Wpot S s L h) z * kernelK S s L h z none ∧
(∀ x : Config S (Fin N),
(∫ z : Fin N → ℝ, normDens (Wpot S s L h) z * kernelK S s L h z (some x)) /
(1 - ∫ z : Fin N → ℝ, normDens (Wpot S s L h) z * kernelK S s L h z none) =
gibbs S J h x)) ∧
(∀ {β : Type*} [Fintype β] (P Q P_out : Option β → ℝ),
IsDistribution P → IsDistribution Q → IsDistribution P_out → 0 < 1 - Q none →
(∃ c : ℝ, 0 ≤ c ∧ ∀ x : β, P_out (some x) = c * P (some x)) →
tvDist P_out (fun y => Option.elim y 0 (fun x => Q (some x) / (1 - Q none))) ≤
tvDist P Q / (1 - Q none) + P_out none) ∧
(∀ (p : ℝ) (t : ℕ), 0 ≤ p → p ≤ 1 → (1 - p) ^ t ≤ Real.exp (-p * t)) ∧
(∀ (S : SpinLaw) (p : ℕ), 2 ≤ p →
∀ (C_poly C_exp : ℝ), 0 < C_poly → 0 < C_exp → ∀ (k_poly : ℕ),
∃ C : ℝ, 0 < C ∧ ∀ (N B m : ℕ) (δ : ℝ) (T : ℝ),
0 ≤ δ → 5 ≤ m →
((∃ s : ℝ, tau S < s ∧
s - tau S ≤ tau S * δ + 1 / ((max 1 N : ℝ) ^ (((p : ℝ) - 1) / (p : ℝ))) ∧
T ≤ C_poly * ((N : ℝ) + (B : ℝ) + (m : ℝ)) ^ k_poly *
Real.exp (C_exp * (N : ℝ) * (s - tau S) ^ ((p : ℝ) / ((p : ℝ) - 1)))) ∨
(1 < δ ∧
T ≤ C_poly * ((N : ℝ) + (B : ℝ) + (m : ℝ)) ^ k_poly *
Real.exp (C_exp * (N : ℝ)))) →
T ≤ C * ((N : ℝ) + (B : ℝ) + (m : ℝ)) ^ k_poly *
Real.exp (C * (N : ℝ) * δ ^ ((p : ℝ) / ((p : ℝ) - 1)))) := by sorry
end CritWinSpinSource
Decomposition child of CritWinSpin.p4c_theorem_4_4_from_lemma_4_3