Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedverified 2026-09-23 (gpt-6-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 sl2 Verma embedding chain

Example

For sl2 and m∈Z≥0, the dot reflection sends m to −m−2, and the singular vector fm+1vm gives M(−m−2)↪M(m). At m=0 this is M(−2)↪M(0); when m∉Z≥0 there is no nontrivial reflection embedding from M(s⋅m) into M(m).

Facts & Assumptions

Given: The standard sl2 relations [e,f]=h, [h,f]=−2f, the Verma PBW model The PBW model of a Verma module, its universal property The universal property of Verma modules, and injectivity of nonzero Verma maps A nonzero homomorphism between Verma modules is injective.

Verification

technique · direct
1.1givenalgebra

Since ρ=1 and s⋅m=−m−2, the relevant pairing is m+1, which is positive integral exactly when m∈Z≥0. The PBW vectors frvm (r≥0) form a basis of M(m). The relations in the Given imply hfrvm=(m−2r)frvm and, by induction from efr+1vm=fefrvm+hfrvm, imply efrvm=r(m−r+1)fr−1vm for r≥1.

2.1step 1.1given∎

For m∈Z≥0, step 1.1 makes the nonzero PBW vector fm+1vm singular of weight m−2(m+1)=−m−2. The Verma universal property gives a nonzero map M(−m−2)→M(m), and the cited injectivity lemma makes it the displayed embedding, including m=0. For any m∈C, the PBW weights of M(m) are m−2r for integers r≥0. A nonzero map M(s⋅m)→M(m) must send its highest vector to a nonzero vector of weight s⋅m=−m−2, so r=m+1∈Z≥0. If r>0, then m∈Z≥0; if r=0, then m=−1 and s⋅m=m, so the map is a scalar identity on the cyclic module rather than a nontrivial reflection embedding. No other m permits the claimed direction.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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