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.

Every element lies in a maximal torus

Statement

Assume the Axiom of Choice. Every element of a compact connected Lie group belongs to a maximal torus.

Facts & Assumptions

Given: Assume the Axiom of Choice, a compact connected Lie group G with identity e, Lie algebra g and an element gG.

[A1]

The Axiom of Choice is The Axiom of Choice; it enters through the Haar-based averaging of [L1] and the greedy theory of [L3], and through the countable-choice content of [L2] inside the ambient ZFC setting.

[L1]

G carries a Riemannian metric invariant under both translations, and for such a metric the geodesics through the identity are exactly the one-parameter subgroups texp(tX) (Compact Lie groups admit bi-invariant metrics).

[L2]

Hopf–Rinow: on a connected boundaryless Riemannian manifold with every closed bounded subset compact, every two points are joined by a minimizing geodesic; if the metric is complete these conditions hold (Hopf–Rinow theorem).

[L3]

Every compact Lie group contains a maximal torus and every torus is contained in a maximal torus (Existence of maximal tori).

[L4]

A closed subgroup of a finite-dimensional real Lie group is an embedded Lie subgroup, and the closure of a connected set is connected; a continuous image of the connected space R is connected; a closed subset of the compact group G is compact (Cartan closed subgroup theorem, If A is connected and ABA then B is connected; in particular the closure of a connected set is connected, A continuous image of a connected space is connected, and connectedness is a topological property, A closed subset of a compact metric space is compact).

[L5]

Every compact connected abelian Lie group is a torus (Structure of compact connected abelian Lie groups, Tori and maximal tori).

Proof

technique · direct
1.1

Fix a bi-invariant Riemannian metric g on G by [L1]. Endow G with the induced Riemannian distance; every closed subset of the compact space G is compact by [L4], so the condition "every closed bounded subset is compact" of [L2] holds and Hopf–Rinow applies.

L1L2L4
2.1

By [L2] there is a minimizing geodesic γ:[0,1]G with γ(0)=e and γ(1)=g; write X:=γ(0)g.

L2step 1.1
3.1

By the geodesic clause of [L1] the geodesic through the identity with initial velocity X is the one-parameter subgroup texp(tX), so γ(t)=exp(tX) and in particular g=exp(X).

L1step 2.1
4.1

Let A:=exp(RX) be the closure of the image of the continuous homomorphism texp(tX) from the connected space R. Then exp(RX) is a connected abelian subgroup by additivity of the exponential along the line, so A is a subgroup (the closure of a subgroup is a subgroup, since multiplication and inversion are continuous), it is abelian, it is closed by definition, it is compact by [L4], and it is connected by [L4] as the closure of a connected set. By [L4] it is an embedded Lie subgroup of G; by [L5] it is a torus, and it contains g because g=exp(X)exp(RX).

L4L5step 3.1
5.1

By [L3] the torus A is contained in a maximal torus M of G, so gAM; this includes the case of finite-order g, for which the same computation produces the one-parameter subgroup and no direct use of the cyclic subgroup's identity component is made. The Axiom of Choice entered through the cited averaging and structure theory.

A1L3step 4.1

Depends on

Used by

Dependency tree · two levels

77 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