Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

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 +1: with dkuns defined by using the canonical cover embeddings with coefficient +1 on every arrow, the unsigned edge sums satisfy dk−1uns∘dkuns=0 and form a complex.

Facts & Assumptions

Given: The Axiom of Choice, the A2 setting g=sl3, simple roots α1,α2, W=S3={e,s1,s2,s1s2,s2s1,w0}, a dominant integral weight λ∈Λ+, and the unsigned edge sums dkuns ⁣:Ck(λ)→Ck−1(λ) whose (w,w′)-component is ιw→w′ for every cover w⊳w′ and 0 otherwise (every sign +1).

[F1]

C0(λ)=M(λ), C1(λ)=M(s1∘λ)⊕M(s2∘λ), C2(λ)=M(s1s2∘λ)⊕M(s2s1∘λ), and the covers of the A2 Bruhat graph are w0⊳s1s2, w0⊳s2s1, s1s2⊳s1, s1s2⊳s2, s2s1⊳s2, s2s1⊳s1, s1⊳e, s2⊳e (The Bruhat graph and the BGG Verma sum in degree k, Bruhat intervals of rank two are diamonds).

[F2]

For a cover x⊳y the canonical embedding ιx→y ⁣:M(x∘λ)↪M(y∘λ) is nonzero and injective; for a saturated path x⊳m⊳y the composite ιm→y∘ιx→m is the canonical inclusion of M(x∘λ) into M(y∘λ) and is independent of the middle element m (Bruhat covers give canonical Verma embeddings, and composites are inclusions, Dominant integral dot translates embed canonically in the Verma module).

[F3]

The four nonzero components of d2uns ⁣:C2→C1 are the cover embeddings s1s2→s1, s1s2→s2, s2s1→s1, s2s1→s2, all with coefficient +1. The two nonzero components of d1uns ⁣:C1→C0 are s1→e and s2→e, again with coefficient +1. Composition sums the component composites over intermediate summands (The BGG differential from signed Verma maps).

Counterexample

1.1F1F3

The (s1s2,e)-component of d1uns∘d2uns is the sum ιs1→e∘ιs1s2→s1+ιs2→e∘ιs1s2→s2. These are exactly the two saturated paths s1s2⊳s1⊳e and s1s2⊳s2⊳e of the rank-two interval [e,s1s2].

2.1F2step 1.1

Both composites are the same canonical inclusion ι ⁣:M(s1s2∘λ)↪M(λ) by [F2]. Their coefficients are both +1, so the component equals 2ι.

3.1F2step 2.1∎

The inclusion ι is nonzero and the base field C has characteristic zero, so 2ι≠0. Hence d1uns∘d2uns≠0, and the unsigned sums do not form a complex. Compatible signs are needed to make the two equal path maps cancel.

Depends on

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.

Sources