Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge 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.

Homogeneous degree check for the corrected KLR braid relation

Example

In the specialized cyclotomic KLR algebra of The type-A cyclotomic specialization of the QG-KLR algebras use the grading deg⁡e(i)=0, deg⁡yr=2, deg⁡ψre(i)=−air,ir+1 (The KLR grading and the diagrammatic multiplication). Fix a triple i=(ir,ir+1,ir+2) and put d(i):=−airir+1−airir+2−air+1ir+2, the degree of both three-crossing words ψrψr+1ψre(i) and ψr+1ψrψr+1e(i), computed on the successive permuted colour pairs. Then both sides of the corrected braid relation are homogeneous of degree d(i) and the correction term has the same degree: it is ±1 (degree 0) when ir+2=ir→ir+1 or ir+2=ir←ir+1, it is yr+yr+2−2yr+1 (degree 2) when ir+2=ir⇄ir+1 (the e=2 double edge), and it is 0 otherwise. In particular the single-edge corrected braid relations have degree 0 and the e=2 double-edge corrected braid relation has degree 2; both match the two sides.

Verification

technique · direct

Given: The specialized cyclotomic KLR algebra with the grading above, a

fixed colour triple i, and the cyclic Cartan entries (amm=2,

am,m±1=−1 for e≥3, and a01=a10=−2 for e=2).

1.1givenalgebra

The common degree of the two words. The three crossings of ψrψr+1ψre(i) cross the colour pairs (ir,ir+1), (ir,ir+2), (ir+1,ir+2) of the successive permuted sequences, so its degree is d(i); the other braid word has the same multiset of crossed pairs, hence the same degree d(i).

1.2givenalgebra

The four cases of the correction. Substituting the cyclic Cartan entries: (a) if ir+2=ir→ir+1 then d(i)=−(−1)−2−(−1)=0 and the correction is +1; (b) if ir+2=ir←ir+1 then d(i)=0 and the correction is −1; (c) if e=2 and ir+2=ir⇄ir+1, then airir+1=air+1ir+2=−2 and airir+2=a00=2, so d(i)=2+2−2=2, matching the degree 2 of yr+yr+2−2yr+1; (d) in all other cases the correction is 0. This is the source's case list, and the nonzero correction requires equal outer colours, while zero corrections remain homogeneous without asserting that their degree is zero.

2.1step 1.1step 1.2∎

Conclusion. In each nonzero case the correction term has degree d(i), equal to the common degree of the two braid words computed in step 1.1; in the remaining cases the correction vanishes, so the identity is homogeneous at degree d(i). Hence the single-edge corrected braid relations have degree 0 and the e=2 double-edge corrected braid relation has degree 2, both matching the two sides. The displayed source word order is ψrψr+1ψr−ψr+1ψrψr+1, which equals the native opposite-order τ-difference under ψ=−τ. No choice is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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