 Solution

Assume deletion. If $w=s_1\cdots s_m$ is reduced and $\ell (sw)<m$, then the word $s,s_1,\dots ,s_m$ is not reduced. Deletion removes two letters. It must remove the initial $s$: otherwise left cancellation by $s$ would give a word for $w$ shorter than $m$. Deleting $s$ and one $s_i$ gives the exchange condition.

Assume exchange, and suppose $sw$ and $wt$ are both ascents of $w$. Write $w=s_1\cdots s_m$ reduced. Then $s_1\cdots s_{m}t$ is reduced. If $swt$ is not a two-step ascent, left exchange deletes one letter from this expression. Deleting one of the $s_i$ would, after right cancellation by $t$, express $sw$ with at most $m-1$ letters, contradicting $\ell (sw)=m+1$. Thus exchange deletes the final $t$, and $swt=w$. This is the folding condition.

Finally assume folding. Consider a shortest counterexample to deletion and draw the array of lengths of all consecutive subwords $s_i\cdots s_j$. Adjacent entries differ by at most one because each generator is an involution. Starting at the first place where the full word fails to be geodesic and following the boundary between ascents and descents produces a square in which left and right multiplication are both ascents but the diagonal is not a two-step ascent. Folding identifies the opposite vertices of this square. Cancelling the common prefix and suffix says that two letters of the original word may be deleted. This contradicts the choice of a counterexample and proves deletion. This standard argument is the folding-grid proof of the deletion condition.

Hence