Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Primitive ideals of an enveloping algebra

Definition

Let g be a complex Lie algebra. A two-sided ideal I⊴U(g) (Left, right and two-sided ideals) is primitive if there exists a simple left U(g)-module M (Simple module: a nonzero module with no proper nonzero submodule) with

I=Ann⁡U(g)(M)={u∈U(g):um=0 for every m∈M}

(The annihilator of a module over an enveloping algebra). Equivalently: a two-sided ideal is primitive if it is the kernel of the action of U(g) on some simple module. Every primitive ideal is proper, and U(g)/I admits the faithful simple module M; no highest-weight hypothesis is imposed on M.

Remarks

  • Properness. The module M is nonzero, and 1∈U(g) acts as the identity, so 1∉Ann⁡U(g)(M); a two-sided ideal containing 1 is all of U(g), so a primitive ideal is a proper ideal. This is the only place nonzero-ness of M is used in the definitional consequences.
  • Faithfulness after quotienting. By The annihilator of a module over an enveloping algebra the action of U(g)/I on M is faithful, so the equivalent kernel formulation and the quotient statement describe the same situation.
  • No highest-weight hypothesis. The simple module M in the definition is arbitrary; in particular a primitive ideal need not be realised by a highest weight module in the definition itself. For finite-dimensional complex semisimple g, realization by a simple highest-weight module is Duflo's theorem, not part of this definition.

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