Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Malcev conjugacy of Levi subalgebras

Statement

Any two Levi subalgebras of a finite-dimensional characteristic-zero Lie algebra g are conjugate by a finite product of automorphisms exp(adx) with xnilrad(g).

Facts & Assumptions

Given: Levi subalgebras s0,s1, radical r, and nilradical n of g.

[L1]

Levi factors exist and project isomorphically to g/r (Levi decomposition theorem).

[L2]

Every 1-cocycle of a semisimple algebra in a finite module is a coboundary (First Whitehead lemma).

[L3]

The commutator [g,r] lies in the nilradical (The commutator with the radical lies in the nilradical).

[L4]

A semisimple characteristic-zero algebra is perfect (Semisimple Lie algebras are centerless and perfect).

[L5]

A nonzero finite-dimensional nilpotent Lie algebra has nonzero center (A nonzero nilpotent Lie algebra has nonzero center).

Proof

Proof technique: induction on the radical, strengthened to place every conjugator in [g,r].

1.1

We prove the stronger assertion that the conjugating factors may all be exp(adx) with x[g,r]. If this commutator is zero, then r is central. Each Levi factor is a section of gg/r by [L1]. The difference of two such sections is a linear map to the central algebra r; the two sections preserve brackets, so that difference vanishes on the derived algebra of the quotient. The quotient is semisimple and hence perfect by [L4], so the sections, and therefore the Levi factors, coincide.

L1L4base
1.2

Suppose [g,r]0. It is an ideal contained in the nilradical by [L3], hence is nilpotent and has nonzero center by [L5]. Jacobi shows that this center is an ideal of g. Choose a minimal nonzero g-ideal m in it. Then m is abelian and 0m[g,r]n.

L3L5algebra
2.1

First assume that r itself contains no nonzero proper ideal of g. Then [g,r]=r by step 1.1. The ideal [r,r] is proper because r is nonzero solvable, so minimality makes it zero. Identify both Levi factors with q=g/r. Relative to s0, write s1 as the graph xx+h(x) of a linear map h:s0r. Its being a subalgebra says exactly that h is a 1-cocycle for the adjoint s0-module r. By [L2], h(x)=[x,b] for some br. Since r is abelian, exp(ad(b))=1+ad(b) maps x to x+h(x). Here br=[g,r], proving the strengthened base case.

L2step 1.1base
2.2

In the remaining case, 0mr. The radical of g/m is r/m, so it has smaller dimension. Apply the strengthened induction hypothesis in that quotient. Its conjugating elements lie in [g/m,r/m]=[g,r]/m and therefore lift to elements of [g,r]. The corresponding exponentials on g induce the required quotient exponentials. After applying their finite product, we may assume that s0 and s1 have the same image modulo m.

step 1.2IH
3.1

Now s0+m=s1+m. As in step 2.1, s1 is the graph over s0 of a 1-cocycle with values in the abelian module m. By [L2] it is a coboundary, and the same calculation gives one final conjugation by exp(ada) for some am[g,r].

L2step 2.12.2
4.1

This closes the induction and proves the stated claim because [L3] puts every chosen element in n. If xn, then adx maps g into n and its restriction to the nilpotent algebra n is nilpotent; hence adx is nilpotent and its exponential is a finite polynomial automorphism. When r=0, both Levi factors equal g. Only finite-dimensional minimal-subspace choices occur.

L3step 1.1step 2.2step 3.1discharge-induction: step 2.1

Depends on

Used by

Dependency tree · two levels

22 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