Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Half-observable reflection binding

Proved
FiniteReflectionPositivityMethodsI.halfObservableBinding

by lisamegawatts · Sep 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

discrete-fourier-transformfinite-dimensionalinfrared-boundreflection-positivitystatistical-mechanics

Let XXX be a finite type, let W:X×X→RW:X\times X\to\mathbb RW:X×X→R be a weight, and let F,G:X→RF,G:X\to\mathbb RF,G:X→R be observables. A full configuration is (x,y)(x,y)(x,y), reflection exchanges the coordinates, and the plus-half lift of an observable reads its first coordinate. Then the reflected pairing is exactly

⟨F,ΘG⟩W=∑x∈X∑y∈XW(x,y)F(x)G(y).\langle F,\Theta G\rangle_W=\sum_{x\in X}\sum_{y\in X}W(x,y)F(x)G(y).⟨F,ΘG⟩W​=x∈X∑​y∈X∑​W(x,y)F(x)G(y).

This theorem fixes the half-supported observable convention used by every subsequent reflection-positive kernel; it does not assert positivity of an arbitrary full-vertex correlation matrix.

Preamble
import Definitions.Def_FiniteReflectionPositivityMethodsI

open FiniteReflectionPositivityMethodsI
Formal statement
theorem FiniteReflectionPositivityMethodsI.halfObservableBinding :
    HalfObservableBindingGate := by sorry
Source
Mission-specific finite adapter to the reflected-kernel interface in LeanProofs commit dbf503b2909cc17787d40a21eb75a0c9354cc6ef, lines 40-56: https://github.com/MonumentalSystems/LeanProofs/blob/dbf503b2909cc17787d40a21eb75a0c9354cc6ef/LeanProofs/StatMech/ReflectionPositivityInfraredBound.lean . Reflection-positive half-algebra background: Fröhlich--Israel--Lieb--Simon (1978), DOI 10.1007/BF01940327.
Read-back

What the Lean code literally says, in plain math · GPT-5 Codex (exact deployment identifier not exposed)

For every possibly empty finite base-universe type XXX, every arbitrary real-valued weight w:X→X→Rw:X\to X\to\mathbb Rw:X→X→R, and every arbitrary pair of functions ℓ,r:X→R\ell,r:X\to\mathbb Rℓ,r:X→R, let a full configuration be (x,y)∈X×X(x,y)\in X\times X(x,y)∈X×X, let reflection send (x,y)(x,y)(x,y) to (y,x)(y,x)(y,x), and let the plus lift of h:X→Rh:X\to\mathbb Rh:X→R be (x,y)↦h(x)(x,y)\mapsto h(x)(x,y)↦h(x). The theorem asserts

∑(x,y)∈X×Xw(x,y) ℓ(x) r(y)=∑x∈X∑y∈Xw(x,y) ℓ(x) r(y).\sum_{(x,y)\in X\times X} w(x,y)\,\ell(x)\,r(y)=\sum_{x\in X}\sum_{y\in X}w(x,y)\,\ell(x)\,r(y).(x,y)∈X×X∑​w(x,y)ℓ(x)r(y)=x∈X∑​y∈X∑​w(x,y)ℓ(x)r(y).

Here the left side is exactly the defined reflected pairing: its right observable is first plus-lifted, then evaluated after reflection, which produces r(y)r(y)r(y). There are no symmetry, positivity, normalization, or nonemptiness assumptions on www, ℓ\ellℓ, rrr, or XXX; if XXX is empty, both sums are zero.

Human review
  • Endorsed by Shuze Chen · Sep 18, 2026

  • Endorsed by lisamegawatts · Sep 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me