Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

Two nonconjugate real cartan subalgebras

Statement refuted

Any two Cartan subalgebras of the real Lie algebra sl2(R) are conjugate by an inner automorphism of sl2(R).

Facts & Assumptions

Given: The real Lie algebra g0=sl2(R) with the matrices H=(1001), K0=(0110), e=(0100), f=(0010) and the relations [H,e]=2e, [H,f]=2f, [e,f]=H.

[L1]

sl2(R) is the real Lie algebra of real traceless matrices; its inner automorphisms are the maps Adg(X)=gXg1 for gSL2(R), and more generally every automorphism φ satisfies φ(adH)=adφ(H)φ (General and special linear Lie groups, The special linear Lie algebra sl_2).

[L2]

A Cartan subalgebra is a nilpotent self-normalizing subalgebra (Cartan subalgebra).

[L3]

The lines RK0 and RH are θ-stable Cartan subalgebras of sl2(R): RK0 is the compact one and RH the split one (Compact and split cartan subalgebras of sl two r, Cartan involution and k plus p for sl n r).

[L4]

The two Cartan subalgebras RH and RK0 of sl2(R) are not conjugate by any real inner automorphism (Real Cartan subalgebras need not be conjugate).

Proof technique: direct computation of adjoint spectra.

1.1 The subspaces RK0 and RH are Cartan subalgebras of sl2(R) by [L3], and they are distinct, because K0 is skew-symmetric while H is symmetric and diagonal. [given, L3, algebra]

1.2 The adjoint operator of K0 has spectrum {0,2i,2i}: from the relations one computes [K0,H]=[fe,H]=2f+2e=2(e+f) and [K0,e+f]=[f,e][e,f]=HH=2H, while [K0,K0]=0; hence in the basis (H,e+f,K0) of sl2(R) the operator adK0 has the block matrix (020200000), whose characteristic polynomial is t(t2+4). [given, algebra]

1.3 The adjoint operator of H has spectrum {0,2,2}: by the given relations adH is diagonal in the basis (H,e,f) with eigenvalues 0,2,2, so its characteristic polynomial is t(t2)(t+2). [given, algebra]

2.1 No automorphism of sl2(R) carries RH onto RK0: if φ were such an automorphism with φ(H)=cK0 for some c0, then by [L1] the operators adφ(H) and adH would be conjugate, hence would have the same characteristic polynomial; but step 1.3 gives t(t2)(t+2) for adH and step 1.2 gives t(t2+c24) for adcK0, and no nonzero c makes these polynomials equal (the first has three distinct real roots, the second has a nonzero purely imaginary pair). [step 1.2, step 1.3, L1, algebra]

3.1 Consequently the two Cartan subalgebras RH and RK0 are not conjugate by any automorphism, and in particular not by an inner automorphism; since they are distinct Cartan subalgebras of sl2(R) by step 1.1, they refute the displayed statement, and they are exactly a witness pair for the general phenomenon of [L4]. [step 1.1, step 2.1, L4]

4.1 Scope: the invariant that separates the two lines is the isomorphism type of adH as a real operator, equivalently the position of the line inside k0 or p0: the compact line consists of elements whose adjoint operators have purely imaginary nonzero spectrum, the split line of elements with real nonzero spectrum. The computation is finite, uses no choice principle, and shows that the failure of conjugacy is detected already at the level of all automorphisms, not merely inner ones. [step 1.2, step 1.3, step 2.1, algebra] ∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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