Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 A2 BGG resolution with six Verma summands

Example

Assume the Axiom of Choice (The Axiom of Choice). Let g=sl3 with simple roots α1,α2, W=S3={e,s1,s2,s1s2,s2s1,w0}, and let λ∈Λ+ be dominant integral. The BGG complex has

C0=M(λ),C1=M(s1∘λ)⊕M(s2∘λ),C2=M(s1s2∘λ)⊕M(s2s1∘λ),C3=M(w0∘λ),

with d1 given by the two embeddings M(si∘λ)↪M(λ), d2 given by the four cover embeddings (s1s2⊳s1, s1s2⊳s2, s2s1⊳s2, s2s1⊳s1) with compatible signs, and d3 given by the two cover embeddings w0⊳s1s2 and w0⊳s2s1 with compatible signs. All Bruhat intervals of rank two are diamonds, so d2=0 holds by the square condition, and the complex is exact by The BGG resolution of a finite-dimensional simple module. The weights w∘λ=w(λ+ρ)−ρ are pairwise distinct and the listed embeddings are the canonical submodules inside M(λ).

Facts & Assumptions

Given: The Axiom of Choice, the A2 root system with simple reflections s1,s2 and longest element w0=s1s2s1=s2s1s2, a dominant integral weight λ, and the BGG complex C∙(λ).

[F1]

For type A2 the Weyl group is W=S3={e,s1,s2,s1s2,s2s1,w0} with w0=s1s2s1=s2s1s2 and lengths 0,1,1,2,2,3. The length-adjacent pairs are s1⊳e, s2⊳e, s1s2⊳s1, s1s2⊳s2, s2s1⊳s2, s2s1⊳s1, w0⊳s1s2, w0⊳s2s1; each longer element has a reduced expression containing the shorter one as a subword (w0=s1s2s1 contains s1s2 in positions 1,2 and s2s1 in positions 2,3, and s1s2 contains s1 and s2), so each pair is a Bruhat cover, and since these are all the length-adjacent pairs they are exactly the covers of the A2 Bruhat graph (The Bruhat graph and the BGG Verma sum in degree k, Bruhat covers are right multiplication by positive-root reflections, Finite Weyl root system, lattice and chamber conventions, Finite Weyl positive roots and simple reflections).

[F2]

Ck(λ)=⨁ℓ(w)=kM(w∘λ), so the terms are the four displayed sums, with 1+2+2+1=6 Verma summands in total; the differential dk has (w,w′)-component ε(w,w′)ιw→w′ for a cover w⊳w′ and 0 otherwise (The Bruhat graph and the BGG Verma sum in degree k, The BGG differential from signed Verma maps).

[F3]

For every cover x⊳y the map ιx→y ⁣:M(x∘λ)↪M(y∘λ) is the canonical inclusion of the Verma submodule of M(y∘λ) generated by the singular vector of weight x∘λ, and for a saturated path x⊳m⊳y the composite is the canonical inclusion M(x∘λ)↪M(y∘λ), independent of m (Dominant integral dot translates embed canonically in the Verma module, Bruhat covers give canonical Verma embeddings, and composites are inclusions).

[F4]

A rank-two Bruhat interval {y<m<x} with ℓ(x)=ℓ(y)+2 has exactly two middle elements, both covered by x and covering y; a compatible sign function exists, with opposite total signs on the two saturated paths of every such interval (Bruhat intervals of rank two are diamonds, Compatible signs exist on the Bruhat graph).

[F5]

For a complex built from compatible signs as in [F2] one has dk−1∘dk=0 for all k≥2, because each component is a sum over the (zero or two) middle elements of a rank-two interval and the two path contributions cancel by [F4] (The BGG differential squares to zero).

[F6]

For λ∈Λ+ the augmented BGG complex is exact, and the weights w∘λ are pairwise distinct (The BGG resolution of a finite-dimensional simple module, Positive coroot pairings of a dominant integral weight).

Verification

1.1F1F2

The six summands: by [F1] the lengths are 0,1,1,2,2,3, so C0=M(λ), C1=M(s1∘λ)⊕M(s2∘λ), C2=M(s1s2∘λ)⊕M(s2s1∘λ) and C3=M(w0∘λ): six Verma summands in total, as displayed.

1.2F1F2F3

The differentials: the covers of [F1] fall into 2 (from length 1 to 0), 4 (from length 2 to 1) and 2 (from length 3 to 2); by [F2] the components of d1,d2,d3 are exactly the signed cover embeddings listed in the Example, and by [F3] these listed embeddings are the canonical submodules of the ambient M(λ) along the respective paths.

1.3F6

Exactness: by [F6] the full sequence 0→C3→C2→C1→C0→L(λ)→0 is exact; this is the assertion that the displayed six-summand complex resolves L(λ). The weights w∘λ for the six elements w are pairwise distinct by [F6], so the six summands are pairwise non-isomorphic labelled Verma modules.

2.1F4F5step 1.2

The rank-two intervals of the Bruhat poset of type A2 are [e,s1s2] with middles s1,s2, [e,s2s1] with middles s1,s2, [s1,w0] with middles s1s2,s2s1, and [s2,w0] with middles s1s2,s2s1; each has exactly two middle elements by [F4]. Hence every component of d2 either is zero (no middle) or cancels by the square condition, so dk−1∘dk=0 for all k≥2 by [F5].

3.1step 1.1step 1.2step 2.1step 1.3∎

Each listed structural claim is verified: the terms in step 1.1, the signed cover differentials in step 1.2, vanishing of d2 in step 2.1, and exactness and weight distinctness in step 1.3.

Depends on

Used by

Dependency tree · two levels

37 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