Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The universal coefficient space of the general linear Lie algebra

Open
QAlgorithms.Papers.Independent.Intakenext100.P67.generalLinear_universalFormSpace

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For an integer n≥2n\ge2n≥2, let gln(R)\mathfrak{gl}_n(\mathbb R)gln​(R) be the real matrix Lie algebra, sln(R)\mathfrak{sl}_n(\mathbb R)sln​(R) its trace-zero subalgebra, and R\mathbb RR the one-dimensional abelian Lie algebra. Then

V(gln(R))≅V(sln(R))⊕V(R)≅R2.V(\mathfrak{gl}_n(\mathbb R))\cong V(\mathfrak{sl}_n(\mathbb R))\oplus V(\mathbb R)\cong\mathbb R^2.V(gln​(R))≅V(sln​(R))⊕V(R)≅R2.

This is a concrete instance of the universal coefficient decomposition. The range n≥2n\ge2n≥2 is implicit in the source's assertion that sln\mathfrak{sl}_nsln​ is central simple. At n=1n=1n=1 the coefficient space has dimension one.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P67
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P67

open scoped TensorProduct

universe u v w

attribute [local instance] QAlgorithms.Papers.Independent.Intakenext100.P67.dependentLieRing

attribute [local instance] QAlgorithms.Papers.Independent.Intakenext100.P67.dependentLieAlgebra

section MatrixExample

attribute [local instance] LieRing.ofAssociativeRing

/-- Example B.5, PDF p. 42: for n ≥ 2 the universal coefficient space of
gl_n(R) splits into those of sl_n(R) and the one-dimensional abelian algebra,
and this direct sum is R². The source's assertion that sl_n is central simple
implicitly requires n ≥ 2; n = 0 and n = 1 are not included. -/
theorem generalLinear_universalFormSpace (n : ℕ) (hn : 2 ≤ n) :
    Nonempty (UniversalFormSpace (Matrix (Fin n) (Fin n) ℝ) ≃ₗ[ℝ]
      (UniversalFormSpace (LieAlgebra.SpecialLinear.sl (Fin n) ℝ) ×
        UniversalFormSpace ℝ)) ∧
    Nonempty ((UniversalFormSpace (LieAlgebra.SpecialLinear.sl (Fin n) ℝ) ×
        UniversalFormSpace ℝ) ≃ₗ[ℝ] (ℝ × ℝ)) := by sorry

end MatrixExample

end QAlgorithms.Papers.Independent.Intakenext100.P67
Source
Central extensions of groups of sections, arXiv:0711.3437v2, PDF p. 42, Example B.5
Read-back

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

For every natural number nnn satisfying 2≤n2\le n2≤n, let gln(R)\mathfrak{gl}_n(\mathbb R)gln​(R) be the real Lie algebra of n×nn\times nn×n real matrices and sln(R)\mathfrak{sl}_n(\mathbb R)sln​(R) its subalgebra of trace-zero matrices, both with bracket [X,Y]=XY−YX[X,Y]=XY-YX[X,Y]=XY−YX; regard R\mathbb RR as a real Lie algebra with zero bracket. For each of these Lie algebras AAA, define Q(A)Q(A)Q(A) to be the real vector space A⊗RAA\otimes_{\mathbb R}AA⊗R​A modulo the real linear span of all elements x⊗y−y⊗xx\otimes y-y\otimes xx⊗y−y⊗x, for x,y∈Ax,y\in Ax,y∈A, and all elements [x,y]⊗z+y⊗[x,z][x,y]\otimes z+y\otimes[x,z][x,y]⊗z+y⊗[x,z], for x,y,z∈Ax,y,z\in Ax,y,z∈A. Then there exists a real-linear bijection

Q(gln(R))  ⟶  Q(sln(R))×Q(R),Q\bigl(\mathfrak{gl}_n(\mathbb R)\bigr)\;\longrightarrow\; Q\bigl(\mathfrak{sl}_n(\mathbb R)\bigr)\times Q(\mathbb R),Q(gln​(R))⟶Q(sln​(R))×Q(R),

and there also exists a real-linear bijection

Q(sln(R))×Q(R)  ⟶  R×R.Q\bigl(\mathfrak{sl}_n(\mathbb R)\bigr)\times Q(\mathbb R) \;\longrightarrow\;\mathbb R\times\mathbb R.Q(sln​(R))×Q(R)⟶R×R.
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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