Alphabeta Math
LemmaStatement: AI-generatedProof: 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.

Standard expressions are connected by atomic braid moves

Statement

Any two standard expressions of the same article morphism are related by finitely many atomic braid moves, with endpoints preserved and every intermediate expression standard.

Facts & Assumptions

[F1]

Use the arbitrary-rank Coxeter system, elementary arrows, standard expressions and left-to-right groupoid conventions of Standard expressions and their lengths. All paths are finite.

[F2]

Any two standard expressions of one morphism have the same number of factors, by Brink–Howlett generators and invariance of standard length.

[F3]

Every article morphism has a standard expression, by Every standard expression counts the same parallel classes.

[F4]

Two distinct elementary arrows with a common source that length-additively left-divide a morphism force a finite relative root difference and have the length-additive common prefix supplied by Two elementary prefixes force a finite rank-two relative root set.

[F5]

Under that finiteness hypothesis, Two-generator minimal common left multiple supplies exactly two standard expressions of the common prefix, one starting with each specified generator. Their equality is the atomic braid relation of Atomic braid relations.

Proof

Given: The arbitrary-rank Coxeter and groupoid data of [F1], with the mathematical inputs [F2], [F3], [F4] and [F5].

Goal: Establish the assertion in the Statement.

Proof technique: direct.

1.1F1F2

Each elementary arrow has positive Coxeter length: its one-factor expression is standard by definition, whereas the identity has an empty standard expression, so [F2] rules out an elementary arrow being the identity. Concatenating shortest simple-generator words proves Coxeter-length subadditivity. For any contiguous block of a standard expression, subadditivity gives ℓ(w)≤∑outsideℓ(vi)+ℓ(block)≤∑iℓ(vi)=ℓ(w); hence the block is standard. In particular, prefixes and suffixes are standard. Induct on the Coxeter length of the common product w. At length zero both expressions are empty; removing a first factor from a nonempty standard expression strictly reduces product length.

2.1F1step 1.1

Let the two nonempty standard words be U,V for w:I→K, and let their first arrows be e:I→H and f:I→H′. If e=f, their remaining words are standard expressions for the same morphism e−1w:H→K of smaller Coxeter length. Induction connects these tails by finitely many atomic braid moves through standard expressions. Prepending e preserves endpoints and standardness, because every tail has product e−1w and length sum ℓ(w)−ℓ(e).

2.2F1F3F4F5step 1.1

Otherwise e≠f. Write e=va,I and f=vb,I. The same source and index determine the same elementary arrow by [F1], so a≠b. Step 1.1 shows that these distinct arrows are length-additive prefixes of w, so [F4] gives the finite relative root difference and a common prefix q=va,b,I:I→L with ℓ(w)=ℓ(q)+ℓ(q−1w). By [F5], its two standard words are A=eA′ and B=fB′. The remainder z=q−1w:L→K is a groupoid morphism, so choose a standard word Z for it using [F3]. The words AZ and BZ have the required endpoints, product w, and length sum ℓ(q)+ℓ(z)=ℓ(w), so both are standard.

3.1F1F5step 1.1step 2.1step 2.2∎

The tails of U and AZ after their common first arrow e are standard words for e−1w:H→K of strictly smaller Coxeter length. Induction connects them, and prepending e gives a standard chain from U to AZ. The same argument with f gives a standard chain from V to BZ. Replace A by B in AZ using the atomic braid relation of [F5], keeping Z fixed. This preserves endpoints and standardness, since A and B have the same product q and both have length sum ℓ(q). Concatenate the first chain, this one move, and the reversed second chain. The resulting finite chain connects U to V with every intermediate expression standard, completing the induction.

Depends on

Used by · 2

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.