Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Standard complex structure J=(0−II0)J = \begin{pmatrix} 0 & -I \\ I & 0 \end{pmatrix}J=(0I​−I0​)

Definition
PassivityUn_stdJ

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

linear-algebramatrices

For a natural number nnn, let Blk(n)\mathrm{Blk}(n)Blk(n) be the disjoint union of two copies of {0,…,n−1}\{0,\dots,n-1\}{0,…,n−1}. Real matrices indexed by Blk(n)\mathrm{Blk}(n)Blk(n) are the real 2n×2n2n\times 2n2n×2n matrices written in 2×22\times 22×2 block form with n×nn\times nn×n blocks, the first copy indexing the upper/left blocks.

The standard complex structure is the block matrix

Jn=(0−InIn0),J_n = \begin{pmatrix} 0 & -I_n \\ I_n & 0 \end{pmatrix},Jn​=(0In​​−In​0​),

where InI_nIn​ is the n×nn\times nn×n identity matrix.

This is the fixed matrix against which "respecting the complex structure" is measured throughout the mission; it satisfies Jn2=−1J_n^2 = -1Jn2​=−1 (milestone M1).

Formalization Note Blk(n)\mathrm{Blk}(n)Blk(n) is Fin n ⊕ Fin n, and JnJ_nJn​ is Matrix.fromBlocks 0 (-1) 1 0.

Definition code
import Mathlib

open Matrix

namespace PassivityUn

/-- Index type for 2n × 2n matrices in 2 × 2 block form. -/
abbrev Blk (n : ℕ) := Fin n ⊕ Fin n

/-- The standard complex structure J = [[0, -I], [I, 0]]. -/
def stdJ (n : ℕ) : Matrix (Blk n) (Blk n) ℝ :=
  Matrix.fromBlocks 0 (-1) 1 0

end PassivityUn
Source
Shape Zero LLC, "Formal Proofs of the C1 Verification Package" (August 2026), §6, Theorem 6.1 (complex structure J): 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(b): 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

Index type. For each natural number nnn, the declaration fixes the index set Blk(n)={0,…,n−1}⊔{0,…,n−1}\mathrm{Blk}(n) = \{0,\dots,n-1\} \sqcup \{0,\dots,n-1\}Blk(n)={0,…,n−1}⊔{0,…,n−1}. This is the disjoint union of two copies of {0,…,n−1}\{0,\dots,n-1\}{0,…,n−1}. Write ι1(i)\iota_1(i)ι1​(i) for index iii in the first copy and ι2(i)\iota_2(i)ι2​(i) for index iii in the second. Matrices indexed by Blk(n)\mathrm{Blk}(n)Blk(n) are 2n×2n2n \times 2n2n×2n real matrices split into four n×nn \times nn×n blocks, with the first copy as the first block of rows or columns and the second copy as the second.

Definition of JnJ_nJn​. For each n∈Nn \in \mathbb{N}n∈N, JnJ_nJn​ (stdJ n) is the real matrix with rows and columns indexed by Blk(n)\mathrm{Blk}(n)Blk(n) given in block form by

Jn  =  (0−InIn0),J_n \;=\; \begin{pmatrix} 0 & -I_n \\ I_n & 0 \end{pmatrix},Jn​=(0In​​−In​0​),

where InI_nIn​ is the n×nn \times nn×n identity matrix and 000 is the n×nn \times nn×n zero matrix. The four blocks are:

  • Upper-left (rows and columns from the first copy): zero.
  • Upper-right (rows from the first copy, columns from the second): minus the identity.
  • Lower-left (rows from the second copy, columns from the first): plus the identity.
  • Lower-right (rows and columns from the second copy): zero.

Entries. For all i,j∈{0,…,n−1}i, j \in \{0,\dots,n-1\}i,j∈{0,…,n−1}, with δij\delta_{ij}δij​ the Kronecker delta:

(Jn)ι1(i), ι1(j)=0,(Jn)ι1(i), ι2(j)=−δij,(Jn)ι2(i), ι1(j)=δij,(Jn)ι2(i), ι2(j)=0.(J_n)_{\iota_1(i),\,\iota_1(j)} = 0,\qquad (J_n)_{\iota_1(i),\,\iota_2(j)} = -\delta_{ij},\qquad (J_n)_{\iota_2(i),\,\iota_1(j)} = \delta_{ij},\qquad (J_n)_{\iota_2(i),\,\iota_2(j)} = 0.(Jn​)ι1​(i),ι1​(j)​=0,(Jn​)ι1​(i),ι2​(j)​=−δij​,(Jn​)ι2​(i),ι1​(j)​=δij​,(Jn​)ι2​(i),ι2​(j)​=0.

Edge case and scope. When n=0n = 0n=0, the index set is empty and J0J_0J0​ is the empty 0×00 \times 00×0 matrix. The file makes no other definitions and no assertions about JnJ_nJn​. It states no properties such as skew-symmetry or Jn2=−I2nJ_n^2 = -I_{2n}Jn2​=−I2n​.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me