Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Passive forces symmetric (needs L≥3L \ge 3L≥3)

Proved
PassivityTorus.symm_of_passive

by ShapeZero · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

latticelinear-algebramatrices

Let L≥3L \ge 3L≥3, and let W(x,a)W(x,a)W(x,a) be real d×dd\times dd×d link matrices on the periodic lattice (Z/LZ)q(\mathbb{Z}/L\mathbb{Z})^q(Z/LZ)q. If PW(v)=0P_W(v) = 0PW​(v)=0 for every velocity field vvv, then every link matrix is symmetric:

W(x,a)T=W(x,a)for all sites x and axes a.W(x,a)^{\mathsf T} = W(x,a) \qquad \text{for all sites } x \text{ and axes } a.W(x,a)T=W(x,a)for all sites x and axes a.

This is the "only if" direction of the goal. The hypothesis L≥3L \ge 3L≥3 is necessary: at L=2L = 2L=2 the forward and backward neighbours coincide, and a non-symmetric matrix on every link gives zero power.

Preamble
import Mathlib
import Definitions.Def_PassivityTorus_power

open Matrix BigOperators
Formal statement
namespace PassivityTorus
theorem symm_of_passive (q L d : ℕ) [NeZero L] (hL : 3 ≤ L)
    (W : Site q L → Fin q → Matrix (Fin d) (Fin d) ℝ)
    (h : ∀ v : Site q L → (Fin d → ℝ), power q L d W v = 0) :
    ∀ x a, (W x a)ᵀ = W x a := by sorry
end PassivityTorus
Source
Shape Zero LLC, "Formal Proofs of the C1 Verification Package" (August 2026), §6, Theorem 6.1 (extended to a q-dimensional periodic lattice): https://github.com/ShapeZeroSZ/shape-zero/blob/main/01_source/proofs/ShapeZero_C1_Formal_Proofs.pdf ; corrected in "Errata — C1 Formal Proofs (Sections 3 and 6)", Corrected Theorem 6.1(a) and correction 4 (at least 3 sites): https://github.com/ShapeZeroSZ/shape-zero/blob/main/01_source/proofs/ERRATUM_Theorem_6.1.md
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. Let q,L,d∈Nq, L, d \in \mathbb{N}q,L,d∈N be natural numbers with L≥3L \ge 3L≥3. (A separate typeclass assumption says L≠0L \neq 0L=0, which already follows from L≥3L \ge 3L≥3.) A site is a function x:{0,…,q−1}→Z/LZx : \{0,\dots,q-1\} \to \mathbb{Z}/L\mathbb{Z}x:{0,…,q−1}→Z/LZ, so the set of sites is the discrete torus Λ=(Z/LZ)q\Lambda = (\mathbb{Z}/L\mathbb{Z})^qΛ=(Z/LZ)q, with LqL^qLq elements. Coordinates of a site live in {0,…,L−1}\{0,\dots,L-1\}{0,…,L−1} with arithmetic taken modulo LLL; in particular the element "−1-1−1" is L−1L-1L−1, and adding 111 to L−1L-1L−1 gives 000. For a site xxx, a direction a∈{0,…,q−1}a \in \{0,\dots,q-1\}a∈{0,…,q−1} and a step s∈Z/LZs \in \mathbb{Z}/L\mathbb{Z}s∈Z/LZ, the shift x+s eax + s\,e_ax+sea​ is the site that agrees with xxx in every coordinate except coordinate aaa, which is replaced by xa+s(modL)x_a + s \pmod Lxa​+s(modL). Only the steps s=1s = 1s=1 and s=−1≡L−1s = -1 \equiv L-1s=−1≡L−1 are used below. Because L≥3L \ge 3L≥3, the sites x+eax + e_ax+ea​, x−eax - e_ax−ea​ and xxx are pairwise distinct whenever q≥1q \ge 1q≥1.

Data. WWW is an arbitrary assignment Wx,a∈Rd×dW_{x,a} \in \mathbb{R}^{d\times d}Wx,a​∈Rd×d of a real d×dd \times dd×d matrix to each site x∈Λx \in \Lambdax∈Λ and each direction a∈{0,…,q−1}a \in \{0,\dots,q-1\}a∈{0,…,q−1}. No relation among different Wx,aW_{x,a}Wx,a​ is assumed.

The functional. For a vector field v:Λ→Rdv : \Lambda \to \mathbb{R}^dv:Λ→Rd (an arbitrary choice vx∈Rdv_x \in \mathbb{R}^dvx​∈Rd at every site), define

PW(v)  =  ∑x∈Λ∑a=0q−1⟨vx,  Wx,a vx+ea  −  Wx−ea, a vx−ea⟩,P_W(v) \;=\; \sum_{x \in \Lambda} \sum_{a=0}^{q-1} \Big\langle v_x,\; W_{x,a}\, v_{x+e_a} \;-\; W_{x-e_a,\,a}\, v_{x-e_a} \Big\rangle ,PW​(v)=x∈Λ∑​a=0∑q−1​⟨vx​,Wx,a​vx+ea​​−Wx−ea​,a​vx−ea​​⟩,

where ⟨u,w⟩=∑i=1duiwi\langle u, w\rangle = \sum_{i=1}^d u_i w_i⟨u,w⟩=∑i=1d​ui​wi​ is the standard dot product on Rd\mathbb{R}^dRd and Wx,avW_{x,a} vWx,a​v is the ordinary matrix–vector product. Note that the second term uses the matrix attached to the neighbouring site x−eax - e_ax−ea​ (in the same direction aaa), applied to the value of vvv at x−eax - e_ax−ea​.

Hypothesis. PW(v)=0P_W(v) = 0PW​(v)=0 for every vector field v:Λ→Rdv : \Lambda \to \mathbb{R}^dv:Λ→Rd.

Conclusion. For every site x∈Λx \in \Lambdax∈Λ and every direction a∈{0,…,q−1}a \in \{0,\dots,q-1\}a∈{0,…,q−1}, the matrix Wx,aW_{x,a}Wx,a​ is symmetric:

Wx,aT=Wx,a.W_{x,a}^{\mathsf T} = W_{x,a}.Wx,aT​=Wx,a​.

Degenerate cases. If q=0q = 0q=0, there is exactly one site (the empty function), there are no directions, the inner sum is empty so PW≡0P_W \equiv 0PW​≡0 and the hypothesis holds automatically, and the conclusion quantifies over an empty set of directions, so it holds vacuously. If d=0d = 0d=0, every matrix is the empty 0×00\times 00×0 matrix, PW≡0P_W \equiv 0PW​≡0, and every Wx,aW_{x,a}Wx,a​ is trivially symmetric. The hypothesis is always satisfiable (e.g. by W≡0W \equiv 0W≡0), so the statement is not vacuous in general.

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

    Confirmed by the moderator at approval.

  • Endorsed by ShapeZero · Sep 24, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me