Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicable
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.

Simple wall-crossing elements and maps

PDF p. 10: (3.14)–(3.15)

Definition

Let (W,S) be a Coxeter system indexed by the vertex set Γ0, and fix J⊆Γ0. Write WL for the subgroup generated by the simple generators indexed by L⊆Γ0. Let (x,I)∈Cham(J), where Cham(J) is the algebraic chamber-label set: WJx=xWI and x has minimum length in xWI.

Choose a∈Γ0∖I. Put D=[I,a], the vertices of the connected component containing a in the Coxeter diagram induced on I∪{a}, and suppose WD is finite. For each finite standard parabolic WL, write wL for its longest element and ιL for the permutation of L determined by wLαi=−αιL(i) on its simple roots. Define the simple wall-crossing element and its associated pair by

va,I=wD∖{a}wD,K=(I∪{a})∖{ιD(a)},ωa,I(x,I)=(xva,I,K).

For fixed J, I and a, this defines ωa,I on the labels (x,I)∈Cham(J) satisfying the stated finiteness condition, with values in W×P(Γ0), where P(Γ0) denotes the set of all subsets of Γ0.

Justification

The chamber-label definition supplies W, its standard parabolics, length and the set Cham(J). The connected-support definition makes D a uniquely determined subset of I∪{a} containing a. Since WD∖{a} is a subgroup of the finite group WD, it is finite. The longest-element definition therefore supplies both displayed longest elements and the permutation ιD; in particular ιD(a)∈D⊆Γ0. Thus va,I∈W, K⊆Γ0, and the displayed rule gives a unique pair in the stated codomain for every input. This justification does not assert that the output pair is a chamber label or that it represents an adjacent chamber.

Depends on

Used by · 24

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources