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
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.
Any two standard expressions of one morphism have the same number of factors, by Brink–Howlett generators and invariance of standard length.
Every article morphism has a standard expression, by Every standard expression counts the same parallel classes.
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.
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.
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 ; hence the block is standard. In particular, prefixes and suffixes are standard. Induct on the Coxeter length of the common product . At length zero both expressions are empty; removing a first factor from a nonempty standard expression strictly reduces product length.
Let the two nonempty standard words be for , and let their first arrows be and . If , their remaining words are standard expressions for the same morphism of smaller Coxeter length. Induction connects these tails by finitely many atomic braid moves through standard expressions. Prepending preserves endpoints and standardness, because every tail has product and length sum .
Otherwise . Write and . The same source and index determine the same elementary arrow by [F1], so . Step 1.1 shows that these distinct arrows are length-additive prefixes of , so [F4] gives the finite relative root difference and a common prefix with . By [F5], its two standard words are and . The remainder is a groupoid morphism, so choose a standard word for it using [F3]. The words and have the required endpoints, product , and length sum , so both are standard.
The tails of and after their common first arrow are standard words for of strictly smaller Coxeter length. Induction connects them, and prepending gives a standard chain from to . The same argument with gives a standard chain from to . Replace by in using the atomic braid relation of [F5], keeping fixed. This preserves endpoints and standardness, since and have the same product and both have length sum . Concatenate the first chain, this one move, and the reversed second chain. The resulting finite chain connects to with every intermediate expression standard, completing the induction.
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.