Finite split reflection positivity and infrared-spectrum interface
DefinitionFiniteReflectionPositivityMethodsIThis finite interface fixes the domains needed by the reflection-positivity and infrared-bound algebra. For a finite index set, it defines real quadratic forms, positive-semidefinite kernels, full and zero-mode-restricted kernel domination, and the diagonal free covariance. A reflected configuration is a pair of half-configurations whose coordinates are exchanged; observables are explicitly lifted from the plus half. A split weight has the finite feature expansion
The bundle also defines the exact four-point discrete Fourier modes, the nearest-neighbor Laplacian on the torus, and its eigenvalue function. The distinguished constant mode is built into InfraredSpectrum, and admissible infrared sources satisfy . Two finite controls record why full-vertex reflection positivity and unrestricted domination by a zero-mode-removed covariance are not valid replacements. The Prop-valued gates are the precise theorem interfaces used by the mission; the bundle itself makes no claim about a physical Gibbs measure, Gaussian domination, a thermodynamic limit, or a Kosterlitz--Thouless transition.
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Data.Complex.Basic
import Mathlib.Data.Matrix.Basic
import Mathlib.Data.Real.Basic
noncomputable section
open scoped BigOperators ComplexConjugate
namespace FiniteReflectionPositivityMethodsI
/-! ## Finite positive-semidefinite kernels -/
def quadraticForm {I : Type*} [Fintype I]
(K : Matrix I I ℝ) (f : I → ℝ) : ℝ :=
∑ i, ∑ j, f i * K i j * f j
def PositiveSemidefinite {I : Type*} [Fintype I]
(K : Matrix I I ℝ) : Prop :=
(∀ i j, K i j = K j i) ∧ ∀ f, 0 ≤ quadraticForm K f
def KernelDominated {I : Type*} [Fintype I]
(C G : Matrix I I ℝ) : Prop :=
(∀ i j, C i j = C j i) ∧
(∀ i j, G i j = G j i) ∧
∀ f, quadraticForm C f ≤ quadraticForm G f
/-! ## Reflection on a split finite configuration -/
abbrev FullConfiguration (X : Type*) := X × X
def reflectConfiguration {X : Type*}
(omega : FullConfiguration X) : FullConfiguration X :=
(omega.2, omega.1)
def plusLift {X : Type*} (observable : X → ℝ) : FullConfiguration X → ℝ :=
fun omega => observable omega.1
def reflectObservable {X : Type*}
(observable : FullConfiguration X → ℝ) : FullConfiguration X → ℝ :=
fun omega => observable (reflectConfiguration omega)
def reflectedPairing {X : Type*} [Fintype X]
(weight : X → X → ℝ) (left right : X → ℝ) : ℝ :=
∑ omega : FullConfiguration X,
weight omega.1 omega.2 * plusLift left omega *
reflectObservable (plusLift right) omega
def reflectedKernel {X I : Type*} [Fintype X]
(weight : X → X → ℝ) (observable : I → X → ℝ) : Matrix I I ℝ :=
fun i j => reflectedPairing weight (observable i) (observable j)
structure SplitWeightData (X A : Type*) where
coefficient : A → ℝ
feature : A → X → ℝ
def SplitWeightData.weight {X A : Type*} [Fintype A]
(data : SplitWeightData X A) (left right : X) : ℝ :=
∑ a, data.coefficient a * data.feature a left * data.feature a right
def HalfObservableBindingGate : Prop :=
∀ (X : Type) [Fintype X] (weight : X → X → ℝ)
(left right : X → ℝ),
reflectedPairing weight left right =
∑ x, ∑ y, weight x y * left x * right y
def SplitWeightReflectionPositivityGate : Prop :=
∀ (X A I : Type) [Fintype X] [Fintype A] [Fintype I]
(data : SplitWeightData X A),
(∀ a, 0 ≤ data.coefficient a) →
∀ observable : I → X → ℝ,
PositiveSemidefinite
(reflectedKernel data.weight observable)
def ChessboardGate : Prop :=
∀ (I : Type) [Fintype I] (K : Matrix I I ℝ),
PositiveSemidefinite K →
∀ i j, K i j ^ 2 ≤ K i i * K j j
/-! ## Zero-mode-restricted infrared domination -/
structure InfraredSpectrum (I : Type*) [Zero I] where
eigenvalue : I → ℝ
nonnegative : ∀ k, 0 ≤ eigenvalue k
eq_zero_iff : ∀ k, eigenvalue k = 0 ↔ k = 0
def zeroModeFree {I : Type*} [Zero I] (f : I → ℝ) : Prop :=
f 0 = 0
def KernelDominatedOffZero {I : Type*} [Fintype I] [Zero I]
(C G : Matrix I I ℝ) : Prop :=
(∀ i j, C i j = C j i) ∧
(∀ i j, G i j = G j i) ∧
∀ f, zeroModeFree f → quadraticForm C f ≤ quadraticForm G f
def basisVector {I : Type*} [DecidableEq I] (k : I) : I → ℝ :=
fun j => if j = k then 1 else 0
def freeFieldModeCovariance {I : Type*} [Fintype I] [DecidableEq I] [Zero I]
(beta : ℝ) (spectrum : InfraredSpectrum I) : Matrix I I ℝ :=
fun k q =>
if k = q then
if k = 0 then 0 else 1 / (beta * spectrum.eigenvalue k)
else 0
def FreeCovariancePositiveSemidefiniteGate : Prop :=
∀ (I : Type) [Fintype I] [DecidableEq I] [Zero I]
(beta : ℝ) (spectrum : InfraredSpectrum I),
0 < beta →
PositiveSemidefinite (freeFieldModeCovariance beta spectrum)
def OffZeroModeInfraredGate : Prop :=
∀ (I : Type) [Fintype I] [DecidableEq I] [Zero I]
(beta : ℝ) (spectrum : InfraredSpectrum I)
(C : Matrix I I ℝ),
0 < beta →
KernelDominatedOffZero C (freeFieldModeCovariance beta spectrum) →
∀ k, k ≠ 0 →
C k k ≤ 1 / (beta * spectrum.eigenvalue k)
/-! ## Concrete four-cycle and four-by-four torus spectrum -/
abbrev Cycle4 := Fin 4
abbrev Torus4 := Cycle4 × Cycle4
def cycle4Next (x : Cycle4) : Cycle4 :=
⟨(x.val + 1) % 4, Nat.mod_lt _ (by norm_num)⟩
def cycle4Prev (x : Cycle4) : Cycle4 :=
⟨(x.val + 3) % 4, Nat.mod_lt _ (by norm_num)⟩
def dft4Mode (k x : Cycle4) : ℂ :=
match k.val, x.val with
| 0, _ => 1
| 1, 0 => 1
| 1, 1 => Complex.I
| 1, 2 => -1
| 1, _ => -Complex.I
| 2, 0 => 1
| 2, 1 => -1
| 2, 2 => 1
| 2, _ => -1
| _, 0 => 1
| _, 1 => -Complex.I
| _, 2 => -1
| _, _ => Complex.I
def cycle4Eigenvalue (k : Cycle4) : ℝ :=
if k.val = 0 then 0 else if k.val = 2 then 4 else 2
def cycle4Laplacian (f : Cycle4 → ℂ) (x : Cycle4) : ℂ :=
2 * f x - f (cycle4Next x) - f (cycle4Prev x)
def torus4Mode (k x : Torus4) : ℂ :=
dft4Mode k.1 x.1 * dft4Mode k.2 x.2
def torus4Laplacian (f : Torus4 → ℂ) (x : Torus4) : ℂ :=
4 * f x - f (cycle4Next x.1, x.2) - f (cycle4Prev x.1, x.2) -
f (x.1, cycle4Next x.2) - f (x.1, cycle4Prev x.2)
def torus4Eigenvalue (k : Torus4) : ℝ :=
cycle4Eigenvalue k.1 + cycle4Eigenvalue k.2
def Torus4EigenmodeGate : Prop :=
∀ k x : Torus4,
torus4Laplacian (torus4Mode k) x =
torus4Eigenvalue k * torus4Mode k x
def Torus4SpectrumGate : Prop :=
(∀ k, 0 ≤ torus4Eigenvalue k) ∧
(∀ k, torus4Eigenvalue k = 0 ↔ k = 0) ∧
∃ spectrum : InfraredSpectrum Torus4,
spectrum.eigenvalue = torus4Eigenvalue
/-! ## Load-bearing negative controls -/
def swapFinTwo (i : Fin 2) : Fin 2 :=
if i = 0 then 1 else 0
def diagonalFinTwo : Matrix (Fin 2) (Fin 2) ℝ :=
fun i j => if i = j then 1 else 0
def reflectedFullVertexKernel : Matrix (Fin 2) (Fin 2) ℝ :=
fun i j => diagonalFinTwo i (swapFinTwo j)
def FullVertexReflectionNoGo : Prop :=
¬ PositiveSemidefinite reflectedFullVertexKernel
def zeroRemovedFinTwo : Matrix (Fin 2) (Fin 2) ℝ :=
fun i j => if i = j ∧ i ≠ 0 then 1 else 0
def ZeroModeRestrictionControl : Prop :=
KernelDominatedOffZero diagonalFinTwo zeroRemovedFinTwo ∧
¬ KernelDominated diagonalFinTwo zeroRemovedFinTwo
def ClaimBoundary : Prop :=
HalfObservableBindingGate ∧
SplitWeightReflectionPositivityGate ∧
ChessboardGate ∧
Torus4EigenmodeGate ∧
Torus4SpectrumGate ∧
FreeCovariancePositiveSemidefiniteGate ∧
OffZeroModeInfraredGate ∧
FullVertexReflectionNoGo ∧
ZeroModeRestrictionControl
end FiniteReflectionPositivityMethodsIRead-back
What the Lean code literally says, in plain math · GPT-5 Codex (exact deployment identifier not exposed)
This item introduces the following definitions and propositions. For any possibly empty finite type , any real matrix , and any function , its quadratic form is
The predicate means both that for every and that for every real-valued on . The predicate means that both and are symmetric and for every . Empty index types are included, in which case all displayed sums are zero.
For any type , a full configuration is an ordered pair ; reflection sends to . The plus lift of is the function , and reflection of a function is . For finite , the reflected pairing of a weight and functions is therefore
Given any index type and observables , the reflected kernel is the matrix . Split-weight data on types consists of an arbitrary coefficient function and arbitrary features ; when is finite, its associated weight is
The half-observable binding gate is the proposition that, for every possibly empty finite base-universe type , every weight , and every , the reflected pairing equals the iterated sum . The split-weight reflection-positivity gate is the proposition that, for every possibly empty finite base-universe types and every split-weight datum, if for every , then for every observable family the matrix
is symmetric and satisfies for every . No boundedness, normalization, or nonzero condition is imposed on the features or observables; when , , or is empty, the relevant sums and universal conditions have their usual empty meanings. The chessboard gate is the proposition that every symmetric real matrix on every possibly empty finite base-universe type whose quadratic form is nonnegative on every satisfies for every ; the conclusion is vacuous if is empty and also includes .
For any type equipped with a distinguished element denoted , an infrared spectrum consists of a function such that for every and exactly when . The distinguished-zero structure supplies an element of , so every type occurring in this definition is nonempty. A function is zero-mode-free exactly when ; here too the distinguished-zero structure makes nonempty. For a finite, necessarily nonempty type equipped with a distinguished zero, means that and are symmetric and for every satisfying . For a type with decidable equality and a chosen , the basis vector at is if and otherwise. Given a finite, necessarily nonempty type with decidable equality and a distinguished zero, a real number , and an infrared spectrum , the free-field mode covariance is the diagonal matrix
The definition itself permits every real ; real division is total, so a zero denominator yields the ambient field's totalized value. The free-covariance positive-semidefinite gate says that for every finite, necessarily nonempty base-universe type with decidable equality and a distinguished zero, every , and every infrared spectrum, this is symmetric and has nonnegative quadratic form on every real . The off-zero-mode infrared gate says that for every finite, necessarily nonempty base-universe type with decidable equality and a distinguished zero, every , every infrared spectrum , and every real matrix , if and is dominated by on all with in the preceding symmetric-matrix sense, then for every ,
No positive-semidefiniteness assumption on is separately included. Although is nonempty because it contains , it may have no element distinct from , in which case the final conclusion over is vacuous.
The four-cycle is . Its next and previous maps send respectively to and . The complex Fourier mode has rows, in the order ,
Its declared eigenvalue is , , and . The cycle Laplacian is with the preceding modular maps. The four-by-four torus is ; for and , its mode is , its Laplacian is
with all coordinates reduced modulo , and its declared eigenvalue is . The torus eigenmode gate says that for every , with the real scalar viewed as complex. The torus spectrum gate says simultaneously that for all , that exactly when , and that there exists an infrared-spectrum structure on the nonempty type whose eigenvalue function is exactly .
On , the swap map exchanges and , the matrix is when and otherwise, and the reflected full-vertex kernel is , namely . The full-vertex reflection no-go proposition is , where positive semidefiniteness has the symmetry-and-quadratic-form meaning above. The zero-removed matrix is exactly when and , hence . The zero-mode restriction control is the conjunction that and are symmetric and for every with , and that it is not the case that both matrices are symmetric and for every unrestricted . Finally, the claim-boundary proposition is the conjunction, in order, of the half-observable binding gate, split-weight reflection-positivity gate, chessboard gate, torus eigenmode gate, torus spectrum gate, free-covariance positive-semidefinite gate, off-zero-mode infrared gate, full-vertex reflection no-go proposition, and zero-mode restriction control. These declarations define the named propositions; this definition item does not itself supply proofs that the gates or their conjunction hold.
Confirmed by the mission captain (proposal self-audit).