Alphabeta Math
PropositionStatement: Literature-sourcedProof: 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.

Geodesics are exactly length-additive wall words

PDF p. 13: Proposition 3.29; PDF p. 14: Proposition 3.29

Statement

Let (W,S) be a finite-rank Coxeter system with vertex set Γ0, and fix J⊆Γ0. In its relative chamber arrangement, let p=((x1,I1),…,(xm,Im)) be a nonempty chamber path. For each consecutive pair let ai be its crossing index and vai,Ii∈W its simple wall-crossing element. Put vp=va1,I1⋯vam−1,Im−1, with the empty product equal to the identity. Write ℓ(w) for the least length of a word in the simple generators representing w.

The path p is geodesic, meaning that its number of crossings is minimal among paths with the same endpoints, if and only if ℓ(vp)=∑i=1m−1ℓ(vai,Ii). The empty sum is zero.

Facts & Assumptions

[F1]

The relative space E=ΘJ, cone Cone(J) and distinct relative hyperplanes HJ are specified by Tits cone intersections, relative roots and arrangements. The space E is finite-dimensional by finite rank. The relative cone is convex by Convexity, stratification and faces of the relative cone, so its interior T=Cone(J)∘ is open and convex in E: equal-radius balls about two interior points give equal-radius balls about their convex combinations. The arrangement is locally finite on T by Local finiteness of the interior relative arrangement; hyperplanes missing T do not affect its chambers or crossings. Thus the gallery interface applies. A path crosses each distinct relative hyperplane at most once exactly when it is geodesic. Each adjacency crosses a unique relative hyperplane, and an adjacency changes the side of that hyperplane and no other. The side-change assertion is established in the gallery interface's adjacency argument, step 3.1. Geodesic chamber paths Finite galleries and separating hyperplanes

[F2]

For a crossing from (x,I) with index a, its target has first coordinate xva,I, and its relative supporting hyperplane is the trace of Hxαa={f:f(xαa)=0}. The relevant crossing component is finite. The adjacent-wall formula supplies the common wall, and relative stratification identifies its supporting hyperplane. Simple wall-crossing elements and maps Adjacent chambers and inverse wall-crossing elements Convexity, stratification and faces of the relative cone

[F3]

For such a crossing, ℓ(xva,I)=ℓ(x)+ℓ(va,I) exactly when the base chamber (e,J) and (x,I) lie on the same side of its supporting hyperplane. Length additivity and the base-chamber half-space

[F4]

Translation by the inverse of the first coordinate of a starting label (z,L) bijects its relative arrangement with that for L, sends (z,L) to (e,L), preserves and reflects geodesicity, and preserves every crossing index and crossing element. Translation between relative arrangements in the geodesic argument

[F5]

Word length is the minimum number of simple generators in a representing word; concatenating such words gives ℓ(uv)≤ℓ(u)+ℓ(v) and ℓ(e)=0. Coxeter-system, roots, length and weak-order conventions

Proof

Given: The finite-rank Coxeter system, relative arrangement and path in the Statement. A relative hyperplane separates two chambers when they lie in its opposite open half-spaces.

Proof technique: direct.

Goal: Prove the stated equivalence, including the one-chamber case.

1.1F1F2F3given

First suppose p starts at (e,J). Write vi=vai,Ii and uk=v1⋯vk for 0≤k≤m−1, with u0=e. Repeatedly applying the target formula in [F2] gives xk+1=uk. Let Hk be the relative hyperplane crossed at the kth adjacency. A prefix ending at (xk,Ik) is geodesic exactly when it has crossed no hyperplane twice. If that prefix is geodesic, it has crossed Hk either zero or one time; by the side-change property in [F1], it has crossed it zero times exactly when its endpoint and the base chamber lie on the same side of Hk. Thus the prefix through the kth crossing is geodesic exactly when the preceding prefix is geodesic and the side condition in [F3] holds.

2.1F3F5step 1.1

By induction on k, step 1.1 and [F3] show that the prefix through crossing k is geodesic exactly when ℓ(ui)=ℓ(ui−1)+ℓ(vi) for every 1≤i≤k. The initial one-chamber prefix is geodesic and has u0=e. By [F5], every difference ℓ(ui−1)+ℓ(vi)−ℓ(ui) is nonnegative. Their sum is ∑i=1kℓ(vi)−ℓ(uk), since ℓ(u0)=0. Consequently all the individual equalities hold exactly when ℓ(uk)=∑i=1kℓ(vi). This proves the claim for paths starting at the base chamber, including k=0.

3.1F4step 2.1∎

For a path starting at (z,L), apply [F4]. The translated path starts at (e,L), is geodesic exactly when p is, and has the same ordered crossing elements. Its wall word and the sum of their lengths are therefore the same as those of p, including the empty-product case. Applying step 2.1 to the translated path proves the equivalence for p.

Source notes

The article reference attributes the proposition. The proof uses the declared local suppliers and does not use the proposition itself as a premise.

Depends on

Used by · 3

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