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

Maximal and primitive weights in integrable category O modules

Statement

Every maximal support weight of a nonzero integrable O-module is dominant integral, and every nonzero vector at that weight generates an integrable highest-weight quotient of its Verma module. More generally every primitive vector has dominant integral weight, and U(n−) applied to all primitive vectors spans the module. Here a primitive vector means a nonzero weight vector whose image is nonzero highest weight in some quotient. Generation uses highest weights in relevant subquotients; it does not assert generation by only the globally maximal support spaces of the original module.

Facts & Assumptions

Given: An integrable module V∈O.

[F1]

Support has finite upper sets, and submodules/quotients have induced weight decompositions and belong to O (Kac moody category o).

[F2]

A nonzero integrable highest-weight module has dominant integral highest weight (Dominance is necessary for an integrable highest weight module).

[F3]

The primitive-vector definition and U(n−) spanning theorem hold by Bounded above kac moody weight modules are generated by primitive vectors.

[F4]

A specified highest vector gives a unique map from its Verma module with image its cyclic submodule (Universal property and pbw character of kac moody verma modules).

Proof

1.1F1F2F4given

If V≠0, take any support weight μ. The finite nonempty set of support weights above μ has a maximal element λ, which is also globally maximal: any larger support weight would still belong to that finite set. For any nonzero v∈Vλ, every positive root vector kills v, because its image would have a strictly larger weight. Thus v is highest. Its cyclic submodule inherits the weight decomposition by F1, and both simple local nilpotences by restriction from V. It is integrable, so F2 makes λ dominant integral. F4 makes this cyclic module a highest-weight Verma quotient.

1.2F1F2F3given

If v is primitive of weight λ, choose its witnessing submodule N from F3. The quotient V/N is a weight module by F1. Both simple local nilpotences descend: each quotient vector has a preimage and every power killing that preimage also kills its class. Its cyclic module generated by the specified nonzero highest class of v is therefore integrable. Apply F2 to obtain λ∈P+. This proves dominance for every primitive vector, without claiming that the original representative is itself highest in V.

2.1F2F3step 1.1step 1.2∎

By F3, every vector of V is a finite sum of negative enveloping words applied to primitive vectors. Step 1.2 proves that all the generating weights in this assertion are dominant integral. Step 1.1 supplies the maximal-weight case and the Verma quotient description. The assertion for V=0 is the empty span. In a one-weight module the positive generators vanish and each nonzero vector is already highest. Zero labels are allowed by F2. The existence of one maximal element in a fixed finite upper set and one witness for a fixed primitive vector requires no arbitrary choice family; no AC is used.

Depends on

Used by

Dependency tree · two levels

13 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