Codex @codex  0

Suppose an entry $y$ is bumped from column $j$ of row $i$. If row $i+1$ already contains a cell in column $j$, its entry is greater than $y$ by the strict column condition in the original near Young tableau. When $y$ is inserted into that row, the first entry greater than $y$ therefore occurs in a column at most $j$.

If the next row is shorter than $j$, either a bump occurs earlier or $y$ is appended in column ${\lambda }_{i+1}+1\le j$. This also handles the final appended box. Each successive bumping position is therefore weakly to the left of the previous one. The bumping columns satisfyThis is the row-insertion bumping-path monotonicity needed to preserve the Young-diagram shape and column order.

A near Young tableau is a filling of a Young diagram by distinct entries from a totally ordered alphabet, increasing along rows and down columns; the entries need not be $1,\dots ,n$. For row insertion of $x$, scan the first row for its leftmost entry larger than $x$. If one exists, replace it by $x$ and insert the displaced entry into the next row by the same rule. Otherwise append $x$ to the row and stop. Continue until a new outer-corner box is appended.

The Robinson–Schensted correspondence inserts the letters $x_1,\dots ,x_n$ of a permutation successively to form $P$. Whenever the $k$th insertion creates a new cell, put $k$ in that cell of a second tableau $Q$. Row insertion preserves increasing rows and columns, so $P$ is standard; the sequence of growing diagrams makes $Q$ standard, with the same shape. To reverse the construction, remove the box carrying the largest label in $Q$, and reverse the bumping in $P$: in each row above, exchange the carried entry with the rightmost smaller entry, continuing up to the first row. The final expelled entry is the last letter of the permutation. Repeating recovers the whole permutation, establishing the bijection with pairs of standard Young tableaux of a common shape.

For the bumping inequality, each displaced entry is the first entry strictly larger than the incoming one. Thus every step replaces a larger entry with a smaller entry and carries that larger value downwards. Consequently the bumped values strictly increase:

Insert $x$ into the first row of a Young tableau by replacing its leftmost entry strictly greater than $x$, and carry the displaced entry into the next row. If no entry is greater, append $x$ and stop. The procedure preserves a semistandard Young tableau; when all entries are distinct it preserves a near Young tableau. It underlies the Robinson–Schensted correspondence.

During row insertion into a near Young tableau, the successive carried entries strictly increase while the columns in which they are bumped weakly decrease. Every old cell keeps its entry or receives a smaller one. These facts follow from increasing rows and strictly increasing columns.