Maths Olympiad Prep

Track / Stage 6 / 92 of 400 #1092 of 1964

Problem 1092

National olympiad, first round
Algebra Difficulty 6.1 Prove it

Consider a transformation as in the previous exercise of the form akbbkaa^{k} b^{\ell} \rightarrow b^{k^{\prime}} a^{\ell^{\prime}} with k,,k,1k, \ell, k^{\prime}, \ell^{\prime} \geqslant 1.

Show that if this transformation is terminal, the final position does not depend on the order of operations.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

This property is known as a "confluence" property. To demonstrate it, we will consider a sequence of operations p1,pnp_{1}, \cdots p_{n} that cannot be extended, and a sequence (possibly infinite) q1,q2,q_{1}, q_{2}, \cdots of operations. We will show that we can modify the first sequence of operations without changing its result, so that q1=p1q_{1}=p_{1}. By induction, we will be done: the sequence of operations (qk)\left(q_{k}\right) will be finite and will yield the same result.

If we draw a bar between an aa on the left and a bb on the right of the transformed word by the operation q1q_{1}, then as long as this bar is not used, that is, at the center of a word akba^{k} b^{\ell} that we transform, we leave it and the letters surrounding it remain unchanged. Since after pnp_{n} no more operations can be performed, there exists kk such that pkp_{k} uses this bar.

Thus, we can perform pkp_{k}, then p1,p2,,pk1,pk+1,pnp_{1}, p_{2}, \cdots, p_{k-1}, p_{k+1}, \cdots p_{n}, which gives the same result. Hence the result.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.