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.
Unsigned Bruhat edge sums need not square to zero
Statement refuted
Assume the Axiom of Choice (The Axiom of Choice). In the A2 BGG complex the signs can all be taken equal to : with defined by using the canonical cover embeddings with coefficient on every arrow, the unsigned edge sums satisfy and form a complex.
Facts & Assumptions
Given: The Axiom of Choice, the A2 setting , simple roots , , a dominant integral weight , and the unsigned edge sums whose -component is for every cover and otherwise (every sign ).
, , , and the covers of the A2 Bruhat graph are , , , , , , , (The Bruhat graph and the BGG Verma sum in degree k, Bruhat intervals of rank two are diamonds).
For a cover the canonical embedding is nonzero and injective; for a saturated path the composite is the canonical inclusion of into and is independent of the middle element (Bruhat covers give canonical Verma embeddings, and composites are inclusions, Dominant integral dot translates embed canonically in the Verma module).
The four nonzero components of are the cover embeddings , , , , all with coefficient . The two nonzero components of are and , again with coefficient . Composition sums the component composites over intermediate summands (The BGG differential from signed Verma maps).
Counterexample
The -component of is the sum . These are exactly the two saturated paths and of the rank-two interval .
Both composites are the same canonical inclusion by [F2]. Their coefficients are both , so the component equals .
The inclusion is nonzero and the base field has characteristic zero, so . Hence , and the unsigned sums do not form a complex. Compatible signs are needed to make the two equal path maps cancel.
Depends on
- Compatible signs exist on the Bruhat graph
- Bruhat covers give canonical Verma embeddings, and composites are inclusions
- Bruhat intervals of rank two are diamonds
- The BGG differential from signed Verma maps
- The Bruhat graph and the BGG Verma sum in degree k
- Dominant integral dot translates embed canonically in the Verma module
- The classical BGG category O
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
32 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.