Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Zero net power   ⟺  \iff⟺ every link coupling is symmetric (rings of N≥3N \ge 3N≥3 sites)

Proved
PassivityRing.passive_iff_symm

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

linear-algebramatrices

Let N≥3N \ge 3N≥3 and ddd be natural numbers. On a ring of NNN sites (indices modulo NNN), each site carries a velocity vi∈Rdv_i \in \mathbb{R}^dvi​∈Rd and each link carries a real d×dd\times dd×d matrix WiW_iWi​. The total power of the coupling is

PW(v)=∑ivi⋅(Wi vi+1−Wi−1 vi−1).P_W(v) = \sum_{i} v_i \cdot \bigl( W_i\, v_{i+1} - W_{i-1}\, v_{i-1} \bigr).PW​(v)=i∑​vi​⋅(Wi​vi+1​−Wi−1​vi−1​).

Then

(PW(v)=0 for every v)  ⟺  (WiT=Wi for every i).\bigl( P_W(v) = 0 \ \text{for every } v \bigr) \iff \bigl( W_i^{\mathsf T} = W_i \ \text{for every } i \bigr).(PW​(v)=0 for every v)⟺(WiT​=Wi​ for every i).

So a per-link neighbour coupling on a ring of at least three sites does no net work for every motion exactly when every link matrix is symmetric. The ring-size condition is necessary, and the statement does not assert that the coupling commutes with any complex structure.

Preamble
import Mathlib
import Definitions.Def_PassivityRing_power

open Matrix BigOperators
Formal statement
namespace PassivityRing
theorem passive_iff_symm (N d : ℕ) [NeZero N] (hN : 3 ≤ N)
    (W : Fin N → Matrix (Fin d) (Fin d) ℝ) :
    (∀ v : Fin N → (Fin d → ℝ), power N d W v = 0) ↔ ∀ i, (W i)ᵀ = W i := by sorry
end PassivityRing
Source
Shape Zero LLC, "Formal Proofs of the C1 Verification Package" (August 2026), §6, Theorem 6.1: 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): 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

Theorem PassivityRing.passive_iff_symm.

Setting and binders.

  • NNN and ddd are natural numbers.
  • N≠0N \neq 0N=0 is assumed as a typeclass condition. The hypothesis 3≤N3 \le N3≤N is also assumed, which already implies N≠0N \neq 0N=0.
  • ddd has no constraint. In particular, d=0d = 0d=0 is allowed, and then every matrix and vector is empty.
  • W=(W0,…,WN−1)W = (W_0, \dots, W_{N-1})W=(W0​,…,WN−1​) is an arbitrary family of NNN real d×dd \times dd×d matrices, one for each index i∈Z/NZi \in \mathbb{Z}/N\mathbb{Z}i∈Z/NZ.

Indices run over {0,1,…,N−1}\{0, 1, \dots, N-1\}{0,1,…,N−1}, and all index arithmetic is modular (cyclic), taken mod NNN:

  • i+1i + 1i+1 means (i+1) mod N(i+1) \bmod N(i+1)modN, so (N−1)+1=0(N-1) + 1 = 0(N−1)+1=0.
  • i−1i - 1i−1 means (i−1) mod N(i - 1) \bmod N(i−1)modN, so 0−1=N−10 - 1 = N - 10−1=N−1. Subtraction wraps around. It does not truncate at 000.

Because N≥3N \ge 3N≥3, the constant 111 really is 111, and for every iii the indices i−1i-1i−1, iii, i+1i+1i+1 are three distinct positions on a cycle of length NNN.

The "power" (definition expanded inline). Take a configuration v=(v0,…,vN−1)v = (v_0, \dots, v_{N-1})v=(v0​,…,vN−1​), where each vi∈Rdv_i \in \mathbb{R}^dvi​∈Rd. The quantity PW(v)∈RP_W(v) \in \mathbb{R}PW​(v)∈R is

PW(v)  =  ∑i=0N−1viT(Wi vi+1  −  Wi−1 vi−1),P_W(v) \;=\; \sum_{i=0}^{N-1} v_i^{\mathsf T}\big( W_i\, v_{i+1} \;-\; W_{i-1}\, v_{i-1} \big),PW​(v)=i=0∑N−1​viT​(Wi​vi+1​−Wi−1​vi−1​),

with indices mod NNN. Here:

  • Wi vi+1W_i\, v_{i+1}Wi​vi+1​ is the ordinary matrix–vector product.
  • xTy=∑k=1dxkykx^{\mathsf T} y = \sum_{k=1}^{d} x_k y_kxTy=∑k=1d​xk​yk​ is the standard dot product on Rd\mathbb{R}^dRd.

Assertion. The following two statements are equivalent (a biconditional):

(∀ v∈(Rd)N:  PW(v)=0)  ⟺  (∀ i∈{0,…,N−1}:  WiT=Wi).\Big(\forall\, v \in (\mathbb{R}^d)^N:\; P_W(v) = 0\Big) \iff \Big(\forall\, i \in \{0,\dots,N-1\}:\; W_i^{\mathsf T} = W_i\Big).(∀v∈(Rd)N:PW​(v)=0)⟺(∀i∈{0,…,N−1}:WiT​=Wi​).
  • The left side says that PWP_WPW​ vanishes identically on all real configurations vvv, with no restriction on vvv.
  • The right side says that every matrix WiW_iWi​ is symmetric.

Edge case. When d=0d = 0d=0, both sides hold trivially: every sum over kkk is empty and every 0×00 \times 00×0 matrix is symmetric.

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