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.
Sign cancellation in an A2 Bruhat diamond
Example
Assume the Axiom of Choice (The Axiom of Choice). In the A2 setting of The A2 BGG resolution with six Verma summands, the interval has exactly two saturated paths and , and the interval has exactly two saturated paths and . In each case the two composites of canonical inclusions coincide, while the two products of signs are opposite, so the corresponding component of vanishes: for the -component of the composite of the last two differentials one computes
and analogously for the -component. This makes the cancellation mechanism of The BGG differential squares to zero explicit on the smallest non-abelian diamond.
Facts & Assumptions
Given: The Axiom of Choice, the A2 data of The A2 BGG resolution with six Verma summands with dominant integral weight , and the differentials built from a compatible sign function .
In type A2 the interval has and , and both and lie strictly between because each is a reduced subword of and covers ; hence its two intermediate elements are and the two saturated paths are and . Likewise has , , and both and lie strictly between because contains as a subword and is a subword of both and ; hence its two saturated paths are and . The diamond lemma identifies these as the only saturated paths of the two intervals (Bruhat intervals of rank two are diamonds, Bruhat covers are right multiplication by positive-root reflections, The Bruhat graph and the BGG Verma sum in degree k).
For a cover the -component of the relevant differential is ; consequently a two-step component is the sum over the intermediate elements, and for a saturated path the composite is the canonical inclusion , the same for all (The BGG differential from signed Verma maps, Bruhat covers give canonical Verma embeddings, and composites are inclusions).
For every square the product of the four signs is , so the two saturated paths of a diamond carry opposite total signs: (Compatible signs exist on the Bruhat graph).
Verification
The two diamonds and their paths are as displayed by [F1]; the composites along the two paths in each diamond are equal by [F2], and the two sign products are opposite by [F3].
For the -component of the two contributions come from the middles and : the component equals , where is the common composite ; since the two coefficients are opposite by [F3], the whole component is .
For the -component of the two contributions come from the middles and : the component equals , and this vanishes because the two path products are opposite by [F3].
The two computations exhibit the cancellation explicitly in the two entries that involve both intermediate elements of a diamond: the coincidence of the composites lets the two terms be added, and the opposite signs make the sum zero. This is exactly the mechanism by which the signed differential squares to zero in these components.
Depends on
- The BGG differential squares to zero
- Compatible signs exist on the Bruhat graph
- Bruhat intervals of rank two are diamonds
- Bruhat covers give canonical Verma embeddings, and composites are inclusions
- The A2 BGG resolution with six Verma summands
- The Axiom of Choice
- The BGG differential from signed Verma maps
- Bruhat covers are right multiplication by positive-root reflections
- The Bruhat graph and the BGG Verma sum in degree k
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Sec. 4.1 Step 1, p. 14 (standard reference, not scraped)
- N. Hemelsoet and R. Voorhaar, A computer algorithm for the BGG resolution, arXiv:1911.00871, Sec. 2.2 and Sec. 4.2, pp. 4-6 and 8-9 (standard reference, not scraped)