TheoremBase

Reduced and Cyclically Reduced Words in Unitary Letters

Defines reduced words (no adjacent inverse letters) and cyclically reduced words (also first and last letters not inverse to each other).

Statement

Let N\mathbb{N} be the set of natural numbers with its addition and order, and for k∈Nk\in\mathbb{N} let [k][k] be the initial segment determined by kk. Let d∈Nd\in\mathbb{N}, and let W2dW_{2d}, with empty word ∅\varnothing, the letters w1,…,wkw_{1},\dots,w_{k} of a word ww of length k∈Nk\in\mathbb{N}, and the inverse letters l↦l−1l\mapsto l^{-1} of letters l∈[2d]l\in[2d] be as in Words in Unitary Letters: Generators, Signs, Inverse Letters, Lengths and Adjoint Words.

1. (Reduced words) A word w∈W2dw\in W_{2d} is reduced if w=∅w=\varnothing, or if ww has length k∈Nk\in\mathbb{N} and wi+1≠(wi)−1w_{i+1}\neq(w_{i})^{-1} for every i∈[k]i\in[k] with i<ki<k. Here i+1∈[k]i+1\in[k]: by claim 7 of Properties of the Order on the Natural Numbers there is m∈Nm\in\mathbb{N} with k=i+mk=i+m, and 1≤m1\le m by claim 4 of Properties of the Order on the Natural Numbers, so that i+1≤i+m=ki+1\le i+m=k by claim 6 of Properties of the Order on the Natural Numbers.

2. (Cyclically reduced words) A word w∈W2dw\in W_{2d} is cyclically reduced if it is reduced and, in case ww has length k∈Nk\in\mathbb{N} with 1<k1<k, wk≠(w1)−1w_{k}\neq(w_{1})^{-1}. We write Wd∘W^{\circ}_{d} for the set of cyclically reduced words and, for k∈Nk\in\mathbb{N}, Wd,k∘W^{\circ}_{d,k} for the set of cyclically reduced words of length kk.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…