Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Maximal abelian subspaces of p are conjugate by K

Statement

Assume the Axiom of Choice. Let (G,K) be a Riemannian symmetric pair of noncompact type with Cartan decomposition g0=k0p0 (Riemannian symmetric pair of noncompact type), and let a,a be maximal abelian subspaces of p0 (Maximal split abelian subspace and real rank). Then there is kK with Adka=a. Consequently p0=kKAdka and the real rank of g0 is well defined.

Facts & Assumptions

Given: The Axiom of Choice; a Riemannian symmetric pair (G,K) of noncompact type with global Cartan involution Θ, differential θ, Cartan decomposition g0=k0p0, inner product Bθ, and maximal abelian subspaces a,a of p0.

[A1]

The Axiom of Choice is The Axiom of Choice; it is inherited through the existence of the global decomposition and the compactness of K recorded in [L2].

[L1]

B is negative definite on k0, positive definite on p0, the summands are B-orthogonal, and [k0,p0]p0, [p0,p0]k0 (Bracket relations and Killing signs in a Cartan decomposition).

[L2]

By the symmetric-pair definition, K=GΘ, and the global Cartan decomposition makes K compact and (k,X)kexpX a diffeomorphism K×p0G (Riemannian symmetric pair of noncompact type, Global Cartan decomposition for a connected finite center semisimple Lie group). For kK, the identity ΘCk=CkΘ differentiates to θAdk=Adkθ, so Adk preserves the 1-eigenspace p0. Moreover every Lie-algebra automorphism A preserves the Killing form because adAX=AadXA1 and trace is invariant under conjugation. Hence

Bθ(AdkX,AdkY)=B(AdkX,θAdkY)=B(AdkX,AdkθY)=Bθ(X,Y).
[L3]

The Killing form is invariant. Hence, for Xp0 and Y,Zg0, invariance and θX=X give Bθ([X,Y],Z)=B([X,Y],θZ)=B(Y,[θZ,X])=Bθ(Y,[X,Z]). Thus adX is self-adjoint for Bθ and consequently is diagonalizable with real eigenvalues; a family of pairwise commuting diagonalizable endomorphisms is simultaneously diagonalizable (Trace forms are symmetric and invariant, Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise).

[L4]

A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces; any two maximal tori of a compact connected Lie group are conjugate (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces, Conjugacy of maximal tori).

Proof

technique · direct
1.1

The family {adH:Ha} consists of pairwise commuting diagonalizable endomorphisms of g0 by [L3], hence is simultaneously diagonalizable: g0=λg0λ, where λ runs over the real-linear functionals on a and g0λ={X:[H,X]=λ(H)X for all Ha}. Only finitely many functionals with g0λ0 occur, because each such λ is determined by its values on a basis of a, and each of those values is an eigenvalue of some adHi.

L3
2.1

There exists Ha with λ(H)0 for every λ0 occurring in step 1.1: the kernels of the finitely many nonzero λ are proper subspaces of the real vector space a, and a finite union of proper subspaces cannot exhaust a. For such an H one has Zg0(H)=g00, because the eigenvalues of adH on g0λ are the nonzero numbers λ(H).

L4step 1.1
3.1

For such a regular H one has Zp0(H)=a: the inclusion aZp0(H) is clear, and if XZp0(H) then [H,X]=0, so Xg00; the subspace a+RX of p0 is abelian and contains the maximal a, hence equals a and Xa. The same argument with a in place of a produces Ha with Zp0(H)=a.

step 2.1
4.1

By compactness of K and continuity of Ad the function f(k):=B(AdkH,H) attains a minimum at some k0K.

L1L2step 3.1
5.1

For every Zk0 the smooth function rB(Adexp(rZ)Adk0H,H) is minimized at r=0, so its derivative vanishes there: with Y:=Adk0Hp0 one has 0=B([Z,Y],H)=B(Y,[Z,H]) for all Zk0, since B is invariant. As [Y,H][p0,p0]k0 and B is nondegenerate on k0, it follows that [Y,H]=0.

L1step 4.1
6.1

Hence YZp0(H)=a by step 3.1, so aZp0(Y). Since Zp0(Y)=Adk0Zp0(H)=Adk0a by step 3.1 and equivariance of the centralizer, and the right-hand side is abelian, the maximal abelian subspace a equals Adk0a.

step 3.1step 5.1
7.1

Finally, if Xp0, then RX lies in a maximal abelian subspace a of p0 (existence by finite-dimensionality and the ascending chain condition on subspaces), and step 6.1 gives a=Adka for some kK; hence XkKAdka and p0=kKAdka. In particular dima=dima for any two maximal abelian subspaces, so the real rank is well defined.

step 6.1A1algebra

Depends on

Used by

Cited to discharge well-definedness by Maximal split abelian subspace and real rank.

Dependency tree · two levels

54 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources