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

Conjugacy classes meet T in Weyl orbits

Statement

Assume the Axiom of Choice. Let G be a compact connected Lie group with maximal torus T. Every conjugacy class of G meets T, and two elements t,t′∈T are conjugate in G exactly when t′=w⋅t for some element w of the Weyl group W(G,T)=NG(T)/T.

Facts & Assumptions

Given: Assume the Axiom of Choice, a compact connected Lie group G, a maximal torus T≤G, and t,t′∈T.

[A1]

The Axiom of Choice is The Axiom of Choice; it enters through the covering theorem [L1], the conjugacy theorem [L2], and the closed-subgroup theorem used in [L4] via its countable-choice hypothesis.

[L1]

Every element of G lies in a maximal torus (Every element lies in a maximal torus).

[L2]

Any two maximal tori of G are conjugate (Conjugacy of maximal tori).

[L3]

The Weyl group is W(G,T)=NG(T)/T, and w=gT acts on T by (gT)⋅t=gtg−1, which lies in T because g normalizes T; the action is well defined (Compact Weyl group).

[L4]

For a fixed x∈G, the centralizer CG(x) is closed because it is the equalizer of the continuous maps g↦gx and g↦xg. Under countable choice it is therefore an embedded Lie subgroup by Cartan closed subgroup theorem, and its identity component CG(x)0 is a compact connected Lie group. Every connected subgroup of CG(x) containing the identity lies in this identity component (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1L1L2

Let x∈G. By [L1] there is a maximal torus M with x∈M, and by [L2] there is g∈G with M=gTg−1; then g−1xg∈T, so the conjugacy class of x meets T.

1.2L4

Suppose t′=gtg−1 for some g∈G. Put M:=gTg−1, a maximal torus containing t′. Both T and M lie in CG(t′) and, being connected and containing the identity, lie in the compact connected Lie group H:=CG(t′)0 by [L4]. A torus of H properly containing T or M would also be a torus of G properly containing a maximal torus of G; hence T and M are maximal tori of H.

2.1L2L3step 1.2

By [L2] applied to the compact connected Lie group H, there is h∈H with hTh−1=M=gTg−1. Then n:=g−1h∈NG(T), and since h centralizes t′ we obtain t′=h−1t′h=h−1(gtg−1)h=n−1t n; hence t′ lies in the W(G,T)-orbit of t by [L3].

3.1A1L3step 1.1step 2.1∎

Conversely, if t′=ntn−1 for some n∈NG(T), then t′=ntn−1 is conjugate to t and lies in T; hence conjugacy in G between points of T is exactly the orbit relation of the Weyl group action, and by step 1.1 every conjugacy class meets T. The Axiom of Choice entered through [L1], [L2], and the countable-choice closed-subgroup input in [L4].

Depends on

Used by

Dependency tree · two levels

40 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