OAI/Probability/InvariantIsing/Arrays/UltrametricProduct.lean
8 declarations, 0 contain sorry, 0 declared as axioms
An atom-preserving decomposition for synchronized replica products.
- def
OAI.InvariantIsing.replicaProductFirstline 14 - def
OAI.InvariantIsing.replicaProductSecondline 17 - lemma
OAI.InvariantIsing.ultrametric_product_decompositionline 20 - lemma
OAI.InvariantIsing.measurable_replicaProductFirstline 48 - lemma
OAI.InvariantIsing.measurable_replicaProductSecondline 54 - lemma
OAI.InvariantIsing.replicaProductFirst_abs_leline 60 - lemma
OAI.InvariantIsing.replicaProductSecond_abs_leline 66 - theorem
OAI.InvariantIsing.gg_ultrametric_product_integralline 79Source documentation
The full synchronized triple product is reduced to its two-link GG marginals. Strict comparisons retain the diagonal contribution at atoms.
theorem gg_ultrametric_product_integral {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (R : Ω → RealArray) (hR : Measurable R) (hgg : HasEntryGhirlandaGuerra R μ) (hs : ∀ᵐ x ∂μ, ∀ i j, R x i j = R x j i) (hu : ∀ᵐ x ∂μ, IsUltrametricArray (R x)) (a b Φ : ℝ → ℝ) (ha : Measurable a) (hb : Measurable b) (hΦ : Measurable Φ) {A B C : ℝ} (hA : 0 ≤ A) (hB : 0 ≤ B) (hC : 0 ≤ C) (haB : ∀ x, |a x| ≤ A) (hbB : ∀ x, |b x| ≤ B) (hΦB : ∀ x, |Φ x| ≤ C) : 2 * (∫ x, Φ (R x 0 1) * (a (R x 0 2) * b (R x 1 2)) ∂μ) = (∫ x, ∫ y, Φ x * replicaProductFirst a b x y ∂scalarOverlapLaw μ R ∂scalarOverlapLaw μ R) + (∫ x, ∫ y, Φ x * replicaProductSecond a b x y ∂scalarOverlapLaw μ R ∂scalarOverlapLaw μ R) + ∫ x, Φ x * (a x * b x) ∂scalarOverlapLaw μ R := by …Mentions: OAI.InvariantIsing.replicaProductFirst, OAI.InvariantIsing.scalarOverlapLaw, OAI.InvariantIsing.replicaProductSecond