Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

The adjoint action preserves the associated graded of a two-sided ideal

Statement

Let g be a finite-dimensional complex Lie algebra with the PBW filtration FnU(g), n≥0, and the identification gr⁡U(g)=S(g). For every two-sided ideal I⊆U(g) the associated graded subspace

gr⁡I=⨁n≥0(I∩FnU(g))/(I∩Fn−1U(g))⊆S(g)

is a graded ideal of S(g). Moreover, writing Dx for the derivation of S(g) that extends the linear map ad⁡x ⁣:g→g, y↦[x,y] (Derivations of Lie algebras), one has Dx(gr⁡I)⊆gr⁡I for every x∈g, and, with σn ⁣:FnU(g)→FnU(g)/Fn−1U(g) the degree-n quotient map, the induced derivation satisfies:

σn(ad⁡xu)=Dx(σn(u)),ad⁡xu=xu−ux,

for every n≥0 and u∈FnU(g). If the commutator has degree less than n, its degree-n symbol is zero.

Facts & Assumptions

Given: A finite-dimensional complex Lie algebra g, a two-sided ideal I⊴U(g), and an element x∈g.

[F1]

F∙U(g) is the PBW filtration by tensor degree with F−1=0; multiplication in U(g) induces a product on gr⁡U(g) for which the symbol of a product of elements of Fm and Fn is the product of their symbols (The PBW filtration by tensor degree on the enveloping algebra).

[F2]

An ordered basis of g has its ordered monomials as a basis of U(g), and multiplication identifies gr⁡U(g) with the symmetric algebra S(g); in particular F1U(g)=C⊕g and the symbol of y∈g is y (PBW gives an ordered monomial basis for the enveloping algebra).

[F3]

gr⁡U(g) is commutative: [FmU(g),FnU(g)]⊆Fm+n−1U(g) (The associated graded algebra of the PBW filtration is commutative).

[F4]

I is an additive subgroup closed under left and right multiplication by U(g) (Left, right and two-sided ideals); ad⁡x denotes the linear map y↦[x,y] of g (Derivations of Lie algebras). Any C-linear map g→g extends uniquely to a derivation of the symmetric algebra S(g), by declaring the Leibniz rule on monomials in a basis; this extension is Dx.

Proof

technique · direct
1.1F1F3F4given

I∩FnU(g) defines an increasing filtration of I with I∩F−1U(g)=0, so gr⁡I is a graded subspace of gr⁡U(g) by construction. It is an ideal: if a∈I∩FmU(g) and b∈FnU(g), then ab∈I∩Fm+nU(g) by [F4], and ba∈I∩Fm+nU(g) likewise; passing to symbols with [F1] exhibits every product of a symbol of I with a symbol of U(g) as a symbol of an element of I. Since gr⁡U(g)=S(g) is commutative by [F3], one-sided closure suffices and gr⁡I is a graded ideal.

1.2F1F4givenalgebra

The commutator map ad⁡x ⁣:U(g)→U(g), u↦xu−ux, is a derivation of U(g): ad⁡x(uv)=(xu−ux)v+u(xv−vx)=ad⁡x(u)v+uad⁡x(v). For a word a1⋯am with ai∈g, the derivation rule gives [x,a1⋯am]=∑i=1ma1⋯ai−1[x,ai]ai+1⋯am, and each [x,ai] lies in g; hence every term still has PBW degree at most m, so ad⁡x(FnU(g))⊆FnU(g). It maps I into itself because I is two-sided.

2.1F1step 1.1step 1.2algebra

By step 1.2, ad⁡x preserves each I∩FnU(g), so it induces a graded linear map gr⁡(ad⁡x) of gr⁡U(g) that sends gr⁡I into itself: the induced map is σn(u)↦σn(ad⁡xu), well defined because ad⁡x(Fn−1)⊆Fn−1. The derivation identity of step 1.2 passes to symbols via [F1], so gr⁡(ad⁡x) is a derivation of gr⁡U(g)=S(g).

3.1F2F4step 2.1

On degree one, gr⁡(ad⁡x)(y)=ad⁡x(y)=[x,y] for y∈g, by [F2] and [F4]; that is, the induced derivation restricts on g to the given linear map ad⁡x.

4.1F2F4step 2.1step 3.1algebra∎

A derivation of S(g) is determined by its values on g: on a monomial y1⋯yn the Leibniz rule forces ∑iy1⋯ad⁡x(yi)⋯yn, and a monomial basis of S(g) extends these values linearly. Hence the derivation gr⁡(ad⁡x) of step 2.1, whose degree-one restriction is the given map ad⁡x by step 3.1, equals Dx. Therefore Dx(gr⁡I)=gr⁡(ad⁡x)(gr⁡I)⊆gr⁡I and σn(ad⁡xu)=Dx(σn(u)) for every n≥0 and u∈FnU(g), which is the assertion.

Depends on

Used by

Dependency tree · two levels

10 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