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

Engel's common-zero-vector lemma

Statement

Let V0 be finite-dimensional over any field, and let ggl(V) be a Lie subalgebra. If every xg is a nilpotent endomorphism of V, then there is a nonzero vV such that xv=0 for every xg.

Facts & Assumptions

Given: A nonzero finite-dimensional vector space V and a Lie subalgebra ggl(V) whose inclusion representation is nil.

[L1]

A nil representation is one in which every represented element is a nilpotent endomorphism (Nilpotent transformations and nil representations).

[L2]

An invariant subspace carries a restricted representation and its quotient carries the induced representation (Subrepresentations, quotient representations, and intertwiners).

[L3]

Rank-nullity applies to finite-dimensional endomorphisms (Rank-nullity: dimFV=nullityT+rankT).

Proof

technique · induction on $\dim\mathfrak g$
1.1

If g=0, every nonzero vV is annihilated by g, so the assertion holds.

basegiven
1.2

Assume g0 and that the assertion holds for every nil Lie algebra of operators of dimension strictly smaller than dimg, acting on any nonzero finite-dimensional module.

ihgiven
1.3

Choose a proper subalgebra h<g of maximal dimension; this exists because 0 is proper and the possible dimensions form a nonempty finite set. For Hh, take m>0 with Hm=0 by [L1]. On End(V), adH=LHRH, where LH and RH commute, and every term of (LHRH)2m1 contains either LHm or RHm; hence adH is nilpotent. Its restrictions and induced quotient operators are nilpotent as well.

L1algebra
2.1

The adjoint action of h preserves h, so [L2] gives an action on the nonzero space g/h. By step 1.3 it is nil, and step 1.2 supplies a nonzero coset x+h killed by h. Thus xh and [h,x]h, so the normalizer of h strictly contains h.

L2step 1.2step 1.3
3.1

The normalizer is a subalgebra; maximality of h in step 1.3 and step 2.1 therefore make it all of g, so h is an ideal. Moreover g/h is one-dimensional: otherwise the inverse image of the one-dimensional subalgebra spanned by any nonzero quotient vector would be strictly between h and g. Hence g=hkx.

step 1.3step 2.1algebra
4.1

Apply step 1.2 to h acting on V. Its common kernel V0={vV:hv=0} is nonzero. It is x-stable, because for Hh and vV0, H(xv)=x(Hv)+[H,x]v=0 by ideality from step 3.1.

L2step 1.2step 3.1algebra
5.1

The restriction of x to nonzero finite-dimensional V0 is nilpotent by [L1]. Its kernel is nonzero: if it were zero, rank-nullity [L3] would make xV0 injective, hence every positive power injective, contradicting nilpotence on V00. Choose 0vker(xV0). Then hv=0, xv=0, and step 3.1 gives gv=0. This is a single finite existential choice, not an application of Choice.

L1L3step 3.1step 4.1discharge-induction

Depends on

Used by

Dependency tree · two levels

11 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