latin_double_three_tail_shape_rowLen_succ
Deleting the top row of the shape at k+1 leaves the shape at k, with row indices shifted by one.
Statement
theorem latin_double_three_tail_shape_rowLen_succ (k i : ℕ) :
(latin_double_three_tail_shape (k+1)).rowLen (i+1) =
(latin_double_three_tail_shape k).rowLen i- Source
- Helper for the open enumeration problem in https://arxiv.org/html/2610.29291v1, Conjecture 6.3, using the availability-permanent identity of Lemma 5.4. Exact computational route: experiments 4100, 4103 and 4106.
- Verified
- 24 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- latin_double_three_tail_shapeFor k at least 5, the Young diagram with row lengths (k,k-1,...,4,3,3). Its i-th row has length max(3,k-i) for i < k-1 and is empty…
- latin_double_three_tail_shape_rowLenThe row-length sanity formula for the staircase with two bottom rows of length three.
- Used by 3
- latin_double_three_tail_profile_allEvery Latin tableau in the double-3-tail staircase family has the three canonical column-symbol profiles (nine profiles before permuting…
- latin_double_three_tail_count_stepThe number of tableaux of the next shape is the sum of availability permanents over all tableaux of the previous shape.
- latin_double_three_tail_profile_succInduction step for the double-3-tail staircase profile: for k >= 5, if every Latin tableau of shape (k,k-1,...,4,3,3) has the canonical…
The proof, explained
The proof unfolds the explicit piecewise formula for the row length of latin_double_three_tail_shape on both sides. This reduces the identity to comparing two conditional expressions: row i + 1 of the shape at parameter k + 1 and row i of the shape at parameter k. Splitting into cases on the conditions and applying linear arithmetic shows that the conditions are equivalent and that the row lengths coincide in every case.
Express each row length as a conditional expression.
Rewriting with the formula latin_double_three_tail_shape_rowLen on both sides replaces row i + 1 of the shape at k + 1 by `if i + 1 < (k + 1) - 1 then max 3 ((k + 1) - (i + 1)) else 0`, and row i of the shape at k by `if i < k - 1 then max 3 (k - i) else 0`.
uses
latin_double_three_tail_shape_rowLenrw [latin_double_three_tail_shape_rowLen, latin_double_three_tail_shape_rowLen]The two conditional expressions are equal. automation
Splitting on the if-then-else conditions yields four cases depending on whether i + 1 < (k + 1) - 1 and whether i < k - 1. Because (k + 1) - 1 = k and (k + 1) - (i + 1) = k - i, the conditions are equivalent and the non-zero values coincide. Linear arithmetic (omega) closes all four branches, verifying equality when both conditions hold or both fail and ruling out the contradictory mixed cases.
split_ifs <;> omega
latin_double_three_tail_shape_rowLen- The row length of latin_double_three_tail_shape k at row index i equals max 3 (k - i) when i < k - 1, and 0 otherwise.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem latin_double_three_tail_shape_rowLen_succ (k i : ℕ) : (latin_double_three_tail_shape (k+1)).rowLen (i+1) = (latin_double_three_tail_shape k).rowLen i := by rw [latin_double_three_tail_shape_rowLen, latin_double_three_tail_shape_rowLen] split_ifs <;> omega