Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5

Proved
QAlgorithms.Papers.Independent.Gap50repair.P01.unitary_orthogonal_symplectic

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Identify R2n\mathbb R^{2n}R2n with Cn\mathbb C^nCn by (x,y)↦x+iy(x,y)\mapsto x+iy(x,y)↦x+iy, and use Ω0=(0I−I0)\Omega_0=\left(\begin{smallmatrix}0&I\\-I&0\end{smallmatrix}\right)Ω0​=(0−I​I0​). For a real linear transformation AAA, complex unitary membership means that AAA is complex linear and its complex matrix preserves the standard Hermitian product. Then

U(n)=O(2n,R)∩Sp⁡(2n,R).U(n)=O(2n,\mathbb R)\cap\operatorname{Sp}(2n,\mathbb R).U(n)=O(2n,R)∩Sp(2n,R).

Both directions are asserted, with unitary membership defined independently of the intersection. This identifies the compact subgroup used by the degree constructions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap50repair_P01
Formal statement
noncomputable section

open scoped BigOperators Matrix Matrix.Norms.Frobenius

namespace QAlgorithms.Papers.Independent.Gap50repair.P01

attribute [local instance] Classical.propDecidable

-- Pinned entrywise complexification and symplecticity. The latter uses -Omega0;
-- preserving -Omega0 is equivalent to preserving Omega0, with identical coordinates.

open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)

open QAlgorithms.Papers.Independent.Frontier30.P02 (IsSymplectic)

/-- Proposition 5, PDF p.5: independently defined unitary membership. -/
theorem unitary_orthogonal_symplectic {n : ℕ} (A : GroupedRealMatrix n) :
    IsUnitaryReal A ↔ IsOrthogonal A ∧ IsSymplectic A := by sorry

end QAlgorithms.Papers.Independent.Gap50repair.P01

end
Source
The Conley-Zehnder index for a path of symplectic matrices, arXiv:1201.3728v2, PDF p. 5, Proposition 5
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number nnn, including 000, and every real 2n×2n2n\times2n2n×2n matrix AAA, write Jn=(0−InIn0)J_n=\begin{pmatrix}0&-I_n\\I_n&0\end{pmatrix}Jn​=(0In​​−In​0​) and, in the two coordinate blocks of AAA, put Z=A11+iA21∈Mn(C)Z=A_{11}+iA_{21}\in M_n(\mathbb C)Z=A11​+iA21​∈Mn​(C) by embedding real entries into C\mathbb CC. Then the conjunction AJn=JnAAJ_n=J_nAAJn​=Jn​A and Z∗Z=InZ^*Z=I_nZ∗Z=In​, where Z∗Z^*Z∗ is the conjugate transpose, holds if and only if the conjunction ATA=I2nA^{\mathsf T}A=I_{2n}ATA=I2n​ and ATJnA=JnA^{\mathsf T}J_nA=J_nATJn​A=Jn​ holds. At n=0n=0n=0 these are equalities of empty matrices.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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