Alphabeta Math
CorollaryStatement: 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.

Rank is well-defined

Statement

Assume the Axiom of Choice. All maximal tori of a compact connected Lie group have the same dimension; this common dimension is the rank of G.

Facts & Assumptions

Given: Assume the Axiom of Choice and a compact connected Lie group G.

[A1]

The Axiom of Choice is The Axiom of Choice; it enters through the conjugacy theorem [L1].

[L1]

Maximal tori of G exist, and any two maximal tori of G are conjugate (Existence of maximal tori, Conjugacy of maximal tori).

[L2]

Conjugation Cg(h)=ghg1 is a Lie-group automorphism, hence a diffeomorphism; its restriction to a maximal torus T1 is a Lie-group isomorphism onto gT1g1, so dimT1=dimgT1g1, and a Lie group and its Lie algebra have the same dimension (Conjugation and the adjoint representation of a Lie group, Tori and maximal tori).

Proof

technique · direct
1.1

By [L1] choose a maximal torus T0G. If TG is any maximal torus, [L1] gives gG with T=gT0g1; by [L2] conjugation restricts to a Lie-group isomorphism T0T, so dimT=dimT0.

L1L2
2.1

Maximal tori exist by step 1.1, and every maximal torus has the same dimension as T0. Defining the rank of G to be this common dimension is therefore meaningful and unambiguous. The Axiom of Choice entered only through [L1].

A1step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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