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

Equal-color quiver-flag correspondence is nilHecke

Example

Assume the Axiom of Choice as inherited from the definition and relation suppliers. Take the one-vertex loopless quiver with no arrows, β=2αi and the unique word ν=(i,i). Then E={0}, Fν=Xν=Flag⁡(C2)=P1, dν=1, Zν,ν=P1×P1, and the elementary correspondence τ1 acts on the shifted polynomial summand Pν=k[x1,x2] (unit in degree −1) by the divided difference τ1(f)=f−s1fx1−x2. In particular τ1 is homogeneous of degree −2=−aii, and τ12=0, τ1x1−x2τ1=1, τ1x2−x1τ1=−1; the one-corner convolution algebra is the rank-two nil-Hecke algebra.

Facts & Assumptions

Given: the Axiom of Choice; the one-vertex quiver with no arrows; the dimension vector β=2αi; the unique word ν=(i,i); the incidence data of Quiver full-flag incidence varieties and signed geometric KLR generators.

[F1]

Assume AC. Quiver full-flag incidence varieties and signed geometric KLR generators defines Xν={(x,F)∈E×Fν:xh(Fir)⊆Fjr}, dν, Zν,ν, and the normalized elementary generator σ1=τ1=−[Cν,ν]standard in the equal-color case, with Qii=0 and the equal-color mixed relations.

[F2]

Assume AC. Quiver-flag convolution generators satisfy the signed KLR relations supplies, for every finite loopless quiver and every β, the equal-color operator formula τr(f)=(f−srf)/(xr−xr+1), the degree deg⁡τreν=−aii=−2, the square relation τr2eν=Qiieν and the mixed relations τrxr−xr+1τr=1, τrxr+1−xrτr=−1.

[F3]

Relative-position incidence strata give a faithful geometric PBW basis proves faithfulness and the free polynomial basis of elementary crossing products.

[A1]

The Axiom of Choice is present only because the consumed definition and relation suppliers inherit it; the explicit P1 cell and localization computations below are finite and choice-free (The Axiom of Choice).

Verification

technique · direct
1.1F1F3given

The data. For this quiver E=⨁h:i→jHom⁡(Vi,Vj)={0}, so Xν=Fν=Flag⁡(C2)=P1 with dν=dim⁡CXν=1 and Zν,ν=Xν×EXν=P1×P1. The convolution algebra is therefore the single corner HBM,G(P1×P1;k), a free module over the polynomial ring k[x1,x2] generated by the diagonal class and the elementary class, by [F3] with S2={1,s1}.

2.1F1F2step 1.1

The normalized elementary action. The relative-position-s1 stratum in P1×P1 is the complement of the diagonal, and it is dense, so its closure is all of P1×P1; at the two torus-fixed points of a P1 fiber the tangent Euler classes are x1−x2 and x2−x1. Hence the standard fundamental class acts by (s1f−f)/(x1−x2), and the normalized class τ1=−[C]standard acts by the displayed divided difference (f−s1f)/(x1−x2), which is polynomial because f−s1f is antisymmetric in x1,x2; this is the finite cellwise localization computation over a characteristic-zero field, using the cellular model of P1.

3.1A1F2F3step 1.1step 2.1algebra∎

Direct evaluation gives τ12=0 because D1f is symmetric and hence killed by another divided difference; it also gives τ1x1−x2τ1=1 and τ1x2−x1τ1=−1. The degree is −2. In the abstract nil-Hecke presentation, these mixed relations move dots left and the square relation removes every repeated crossing, so it is spanned by f+gτ1 for f,g∈k[x1,x2]. The two polynomial summands map independently and onto the geometric corner by [F3] and step 1.1. Thus this presentation is isomorphic to the corner, which proves the asserted nil-Hecke identification.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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