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

Root characterization of the inverse two-generator element

PDF p. 19: Remark 4.17

Statement

Let (W,S) be the Coxeter system indexed by a set Γ0, possibly infinite, with its standard geometric representation and positive and negative roots Φ+ and Φ−. For L⊆Γ0, let WL be the subgroup generated by the simple generators indexed by L, let ΦL be its associated parabolic root set, and put ΦL±=ΦL∩Φ±. An associate of J⊆Γ0 is a subset whose standard parabolic subgroup is conjugate to WJ.

Let I be an associate of J, let distinct a,b∈Γ0∖I satisfy ∣ΦI∪{a,b}∖ΦI∣<∞, and put T=I∪{a,b}. Let va,b,I be the two-generator element constructed in the proof of the minimal common left multiple lemma. Then va,b,I−1 is the unique w∈WT satisfying w(ΦT+∖ΦI+)⊆ΦT− and w(ΦI+)⊆ΦT+.

Facts & Assumptions

[F1]

The construction in the minimal common left multiple lemma takes va,b,I=q, where q=r−1 and r=wDwD∩I, with D the union of the components of the diagram induced on T that meet {a,b}. The relative-longest lemma makes D spherical and gives Φ+∩qΦ−=ΦT+∖ΦI+. Here wL denotes the longest element of a finite standard parabolic subgroup WL. Two-generator minimal common left multiple Finite relative longest element without spherical ambient rank

[F2]

In a finite-rank Coxeter system, every root is positive or negative, with the two signs disjoint, and every nonidentity element sends at least one simple root to a negative root. Root sign coherence and the action of simple reflections on positive roots The root-length criterion and faithfulness of the canonical reflection representation

[F3]

Every group element has a finite word in the simple generators. For each finite H⊆Γ0, the canonical map from the Coxeter group presented by the restricted matrix on H into W is injective with image WH, by part 1 of Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank. Thus WH, with the generators indexed by H, is a finite-rank Coxeter system. The geometric reflection formulas in Coxeter-system, roots, length and weak-order conventions restrict to its standard representation on VH=span⁡{αh:h∈H}. Its roots identify with ΦH={xαh:x∈WH,h∈H}, and their positive and negative signs agree with the ambient signs because their coordinates outside H are zero.

Proof

Given: The Coxeter system, roots, subsets and finite relative-root hypothesis in the Statement.

Proof technique: direct.

Goal: Prove the two root-sign conditions for r=va,b,I−1 and show that they determine it in WT.

1.1F1F2F3given

By [F1], r lies in WD⊆WT, and for a positive root α the condition rα∈Φ− is equivalent to α∈Φ+∩qΦ−=ΦT+∖ΦI+. Indeed q=r−1. The action of WT preserves ΦT, directly from its definition as the WT-orbit of the simple roots indexed by T. Consequently r sends the stated difference into ΦT− and sends ΦI+ into ΦT+; for the latter, write a root under consideration as xαi and choose a finite set of indices containing i and the letters in words for x and r. By [F3], both xαi and rxαi are roots of that finite-rank Coxeter system with their ambient signs, so [F2] gives root-sign dichotomy.

2.1F2F3step 1.1given∎

Let w∈WT satisfy both displayed conditions. Choose a finite H⊆T containing the indices in words for both w and r. By [F3], WH is the Coxeter group for the restricted matrix, its roots are ΦH⊆ΦT, and the actions of w, r and wr−1 on them are the finite-rank geometric actions with the same signs. For every positive root α of the finite subsystem on H, the two conditions for w and step 1.1 show that wα and rα have the same sign: α belongs either to ΦI+ or to its complement in ΦT+. These images remain roots of the subsystem on H. Thus wr−1 sends every positive root of that subsystem to a positive root: write such a root as either rα or −rα, with α positive, and use the matching signs. By [F2] applied to this finite-rank Coxeter system, wr−1=1 in WH, hence also in W, so w=r. This proves uniqueness and the assertion.

Source notes

Remark 4.17 attributes the characterization to the discussion following Proposition 2.1 of the article's reference [5]. The proof above uses the completed relative-longest supplier and a finite-subsystem argument; it does not claim to reproduce that discussion.

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