Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-07
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 A2 regular integral-dominant Verma embedding poset

Example

Let λ be regular dominant integral in type A2. The six distinct weights wλ are indexed by W=S3, and there is an embedding M(wλ)M(vλ) exactly when vw in Bruhat order. Thus the directed Hasse diagram runs from the longest element's Verma module down through the two length-two, two length-one, and identity vertices as inclusions into M(λ).

Verification

technique · direct
1.1

Put ν=λ+ρ. Regularity makes the dot orbit free, so its members are indexed by the six elements of S3. For uW and a positive root α, uν,α=ν,(u1α) is positive exactly when u1α is positive; integrality makes every such positive value a positive integer.

givenalgebra
2.1

Write s=sα1, t=sα2, and w0=sts=tst. The positive-reflection pairs are (e,s),(e,t),(e,w0),(s,st),(s,ts),(t,st),(t,ts),(st,w0),(ts,w0). The rank inequalities defining Bruhat order give precisely these reflection comparisons (all except (e,w0) are covers). Thus checking the three positive roots of A2 shows that the reflections satisfying step 1.1 are exactly the pairs u<sαu in Bruhat order. In particular every strong-linkage edge lies in Bruhat order, while every Bruhat cover is one of these positive-integral reflection edges. Taking transitive closures and applying the BGG criterion proves the nonzero-homomorphism equivalence; the cited injectivity lemma turns every such map into an embedding. This proves both directions of the stated embedding equivalence.

step 1.1construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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