Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Wall-crossing acts on standard modules by a two-step extension

Statement

Assume the Axiom of Choice, inherited from the published items. Let θs be the wall-crossing functor of The wall-crossing functor and its unit and counit attached to the simple reflection s in the regular integral block Oλ. For every w∈W the object θsΔ(w⋅λ) has a finite Verma flag with exactly two factors, namely Δ(w⋅λ) and Δ(ws⋅λ), each with multiplicity one; in the Grothendieck group [θsΔ(w⋅λ)]=[Δ(w⋅λ)]+[Δ(ws⋅λ)]. Moreover θs is exact and preserves Verma-filtered objects with finite Verma flags: if X has a finite Verma flag with multiplicities (X:Δ(v⋅λ)), then θsX has one with multiplicities (θsX:Δ(u⋅λ))=(X:Δ(u⋅λ))+(X:Δ(us⋅λ)), and the same formula holds in K0(Oλ). The resulting flag is not in general split; splitting is neither asserted nor used.

Facts & Assumptions

Given: The regular integral block Oλ, a simple reflection s, the wall-crossing functor θs=ToutTon, and the published single-wall translation datum for the wall of s.

[F1]

The onto-wall translation satisfies TonΔ(w⋅λ)≅Δ(w⋅μ) for every w, and the out-of-wall translation satisfies ToutΔ(w⋅μ)≅ a finite Verma flag with exactly the two factors Δ(w⋅λ) and Δ(ws⋅λ), each of multiplicity one, with class [Δ(w⋅λ)]+[Δ(ws⋅λ)] (The wall-crossing functor and its unit and counit, Translation to and from a single wall on standard modules).

[F2]

θs is exact; a finite Verma flag of X pushes forward under an exact functor to a finite flag of θsX; Verma-flag multiplicities are independent of the flag; the class in K0(Oλ) of a Verma-filtered object is the sum of its factor classes (The wall-crossing functor and its unit and counit, Finite Verma flags and their multiplicities, Verma-flag multiplicities are independent of the flag, The Grothendieck group and character of O).

[F3]

Direct summands of Verma-filtered objects are Verma-filtered, and tensoring by a finite-dimensional module preserves Verma flags (Direct summands of Verma-filtered objects are Verma-filtered, Finite-dimensional tensoring preserves Verma flags).

Proof

technique · direct
1.1F1F2

θsΔ(w⋅λ)≅ToutΔ(w⋅μ) by the first clause of [F1], hence it has the two-factor finite Verma flag of the second clause of [F1] with factors Δ(w⋅λ) and Δ(ws⋅λ), each once; its class in K0(Oλ) is [Δ(w⋅λ)]+[Δ(ws⋅λ)] by [F2].

2.1F2step 1.1

Let X be Verma-filtered with finite flag 0=X0⊆X1⊆⋯⊆Xn=X and factors Δ(vi⋅λ). Exactness of θs by [F2] makes 0=θsX0⊆⋯⊆θsXn=θsX an increasing chain of subobjects, and each quotient θsXi/θsXi−1≅θs(Xi/Xi−1)≅θsΔ(vi⋅λ) carries the two-factor flag of step 1.1; concatenating these two-step flags through the chain yields a finite Verma flag of θsX with factor multiplicities (X:Δ(u⋅λ))+(X:Δ(us⋅λ)), where the independence of the flag [F2] makes the count well defined.

3.1F2F3step 2.1algebra∎

Summing the classes along the flag of step 2.1 gives [θsX]=∑i([Δ(vi⋅λ)]+[Δ(vis⋅λ)])=[X]+∑i[Δ(vis⋅λ)], with the multiplicities stated in step 2.1; no splitting of the two-step extensions is used. If θsX=Y⊕Z, [F3] makes both summands Verma-filtered, and their multiplicities add to those of θsX; the formula for the whole object does not prescribe either summand's individual multiplicities.

Depends on

Used by

Dependency tree · two levels

38 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