Proved
PassivityUn.stdJ_sqLet be the standard complex structure on real block matrices. Then, for every natural number ,
This confirms that is a complex structure, which is what makes "commuting with " the condition of being complex-linear.
import Mathlib import Definitions.Def_PassivityUn_stdJ
namespace PassivityUn theorem stdJ_sq (n : ℕ) : stdJ n * stdJ n = -1 := by sorry end PassivityUn
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of PassivityUn.stdJ_sq. Let be any natural number. The claim is universally quantified over , and is included. There are no other hypotheses.
Index set. The rows and columns are indexed by the disjoint union : a "left" copy and a "right" copy of . This set has elements. It is not . Indices are tagged as belonging to the first or the second block.
The matrix . The definition stdJ gives a real square matrix over this index set. It is built from four real blocks:
- The upper-left block (left row, left column) is the zero matrix.
- The upper-right block (left row, right column) is .
- The lower-left block (right row, left column) is the identity .
- The lower-right block (right row, right column) is the zero matrix.
Written out entry by entry:
- every other entry is .
Assertion. The ordinary matrix product of with itself equals the negative of the identity matrix on the full -element index set:
In other words, if and otherwise, for all indices in .
Edge case . The index set is empty, so both sides are the unique empty matrix and the equation holds trivially.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.