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 V≠0 be finite-dimensional over any field, and let g⊆gl(V) be a Lie subalgebra. If every x∈g is a nilpotent endomorphism of V, then there is a nonzero v∈V such that xv=0 for every x∈g.

Facts & Assumptions

Given: A nonzero finite-dimensional vector space V and a Lie subalgebra g⊆gl(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: dim⁡FV=nullity⁡T+rank⁡T).

Proof

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

If g=0, every nonzero v∈V is annihilated by g, so the assertion holds.

1.2ihgiven

Assume g≠0 and that the assertion holds for every nil Lie algebra of operators of dimension strictly smaller than dim⁡g, acting on any nonzero finite-dimensional module.

1.3L1algebra

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 H∈h, take m>0 with Hm=0 by [L1]. On End⁡(V), ad⁡H=LH−RH, where LH and RH commute, and every term of (LH−RH)2m−1 contains either LHm or RHm; hence ad⁡H is nilpotent. Its restrictions and induced quotient operators are nilpotent as well.

2.1L2step 1.2step 1.3

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 x∉h and [h,x]⊆h, so the normalizer of h strictly contains h.

3.1step 1.3step 2.1algebra

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=h⊕kx.

4.1L2step 1.2step 3.1algebra

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

5.1L1L3step 3.1step 4.1discharge-induction∎

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 x∣V0 injective, hence every positive power injective, contradicting nilpotence on V0≠0. Choose 0≠v∈ker⁡(x∣V0). Then hv=0, xv=0, and step 3.1 gives gv=0. This is a single finite existential choice, not an application of Choice.

Depends on

Dependency tree · 2 levels

Sources