Alphabeta Math
RemarkRemark: AI-adaptedProof: AI-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.

The printed root characterization of a wall-crossing element

PDF p. 10: paragraph after (3.15)

Statement

Let (W,S) be a Coxeter system indexed by the vertex set Γ0. For L⊆Γ0, let WL be the subgroup generated by the simple reflections indexed by L, let ΦL be its associated root set, and put ΦL±=ΦL∩Φ±. For a chamber label (x,I)∈Cham(J) and a∈Γ0∖I, suppose WD is finite, where D=[I,a] is the connected component containing a in the Coxeter diagram induced on I∪{a}. Let wL denote the longest element of a finite WL, let ιD be defined by wDαi=−αιD(i), and set va,I=wD∖{a}wD and K=(I∪{a})∖{ιD(a)}.

The article claims that va,I is the unique element satisfying va,I(ΦI∪{a}+∖ΦK+)⊆ΦK− and va,I(ΦK+)⊆ΦI∪{a}+. This claim is false as printed: in the rank-one case below, va,I fails the first inclusion.

Proof

Given: The rank-one Coxeter system with Γ0={a} and generator sa, and J=I=∅, x=1.

[F1] The standard parabolic subgroup WL is generated by the simple reflections indexed by L; ΦL={wαi:w∈WL, i∈L} and ΦL±=ΦL∩Φ±. Standard parabolic subgroups and parabolic roots

[F2] The simple root αa is a nonzero basis vector in the positive cone, and saαa=−αa. Also sa2=1. Coxeter-system, roots, length and weak-order conventions

[F3] A chamber label (x,I) belongs to Cham(J) when WJx=xWI and x has minimum length in xWI. Algebraic chamber-label set

[F4] The set [I,a] is the component containing a of the diagram induced on I∪{a}. Connected component notation [I,a]

[F5] For finite WL, wL is its longest element; ιL is the permutation satisfying wLαi=−αιL(i). In particular w∅=1. Longest parabolic elements and opposition permutation

[F6] The wall-crossing element is va,I=wD∖{a}wD, and K=(I∪{a})∖{ιD(a)}. Simple wall-crossing elements and maps

Proof technique: direct.

Goal: verify the article's hypotheses in this example and show that its first inclusion fails.

1.1F1F2F3F4given

Since W∅={1}, the two cosets in the chamber-label condition are both {1}, and 1 has minimum length in its coset. Thus (1,∅)∈Cham(∅). The induced diagram has the single vertex a, so D={a}. The subgroup WD={1,sa} is finite; sa is nontrivial because it sends the nonzero vector αa to its negative. Hence all the stated hypotheses hold.

2.1F1F2F5F6step 1.1∎

The longest element of WD is sa: the identity has length zero and sa has length one. Consequently ιD(a)=a, K=∅, and va,I=1⋅sa=sa. By the root-set definition, ΦK+=ΦK−=∅, while αa∈Φ{a}+. Thus the left side of the first claimed inclusion contains va,Iαa=−αa, but its right side is empty. The claimed inclusion, and hence the asserted characterization, fails.

Source notes

The counterexample addresses the formula as printed. It does not establish a general replacement characterization.

Depends on

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