Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Generalized almost complex structures ↔\leftrightarrow↔ maximal isotropic LLL with L∩Lˉ=0L\cap\bar L=0L∩Lˉ=0

Proved
GeneralizedComplex.eigenbundle_correspondence

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-geometrygeneralized-complex-geometrylinear-algebra

Let T=RNT=\mathbb R^NT=RN and equip T⊕T∗T\oplus T^*T⊕T∗ with ⟨X+ξ,Y+η⟩=12(ξ(Y)+η(X))\langle X+\xi,Y+\eta\rangle=\tfrac12(\xi(Y)+\eta(X))⟨X+ξ,Y+η⟩=21​(ξ(Y)+η(X)).

  1. If J\mathcal JJ is a generalized almost complex structure (a real linear map with J2=−Id\mathcal J^2=-\mathrm{Id}J2=−Id preserving ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle⟨⋅,⋅⟩), its −1\sqrt{-1}−1​-eigenbundle L⊆(T⊕T∗)⊗CL\subseteq(T\oplus T^*)\otimes\mathbb CL⊆(T⊕T∗)⊗C is maximal isotropic and satisfies L∩Lˉ=0L\cap\bar L=0L∩Lˉ=0.
  2. Conversely, for every complex subspace LLL which is maximal isotropic and satisfies L∩Lˉ=0L\cap\bar L=0L∩Lˉ=0, there is a unique generalized almost complex structure J\mathcal JJ with
L={v∈(T⊕T∗)⊗C: Jv=−1 v}.L=\{v\in(T\oplus T^*)\otimes\mathbb C:\ \mathcal Jv=\sqrt{-1}\,v\}.L={v∈(T⊕T∗)⊗C: Jv=−1​v}.

Thus properties (i) L∩Lˉ=0L\cap\bar L=0L∩Lˉ=0 and (ii) maximal isotropy can be taken as an alternative definition of a generalized almost complex structure.

Throughout, T=RNT=\mathbb R^NT=RN models a tangent space of an NNN-manifold, T∗T^*T∗ its dual (identified with RN\mathbb R^NRN via the standard dual basis), and T⊕T∗T\oplus T^*T⊕T∗ the generalized tangent space with the natural inner product ⟨X+ξ,Y+η⟩=12(ξ(Y)+η(X))\langle X+\xi,Y+\eta\rangle=\tfrac12(\xi(Y)+\eta(X))⟨X+ξ,Y+η⟩=21​(ξ(Y)+η(X)). A generalized almost complex structure is a real linear map J\mathcal JJ of T⊕T∗T\oplus T^*T⊕T∗ with J2=−Id\mathcal J^2=-\mathrm{Id}J2=−Id and ⟨Ju,Jv⟩=⟨u,v⟩\langle\mathcal J u,\mathcal J v\rangle=\langle u,v\rangle⟨Ju,Jv⟩=⟨u,v⟩; its −1\sqrt{-1}−1​-eigenbundle is L={v∈(T⊕T∗)⊗C:Jv=−1 v}L=\{v\in(T\oplus T^*)\otimes\mathbb C:\mathcal Jv=\sqrt{-1}\,v\}L={v∈(T⊕T∗)⊗C:Jv=−1​v}.

Formalization Note The statement is fiberwise: T⊕T∗T\oplus T^*T⊕T∗ is the coordinate space GIdx N → ℝ (vector part on Sum.inl, one-form part on Sum.inr), endomorphisms are matrices indexed by GIdx N, and the complexification is GIdx N → ℂ with the real matrix acting through the coercion R→C\mathbb R\to\mathbb CR→C. All notions are those of the shared definition file Definitions.Def_GeneralizedComplex_Basic.

Preamble
import Definitions.Def_GeneralizedComplex_Basic

open Matrix
Formal statement
namespace GeneralizedComplex

theorem eigenbundle_correspondence (N : ℕ) :
    (∀ J : Matrix (GIdx N) (GIdx N) ℝ, IsGenAlmostComplex J →
      IsMaximalIsotropic (plusIEigenspace J) ∧
        plusIEigenspace J ⊓ conjSubmodule (plusIEigenspace J) = ⊥) ∧
    (∀ L : Submodule ℂ (GIdx N → ℂ), IsMaximalIsotropic L → L ⊓ conjSubmodule L = ⊥ →
      ∃! J : Matrix (GIdx N) (GIdx N) ℝ, IsGenAlmostComplex J ∧ plusIEigenspace J = L) := by sorry

end GeneralizedComplex
Source
Wikipedia, "Generalized complex structure", revision oldid=1288019306, https://en.wikipedia.org/w/index.php?title=Generalized_complex_structure&oldid=1288019306, section Definition > The generalized tangent bundle, eigenbundle paragraph and properties (i), (ii)
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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