latin_double_three_tail_profile_all
Every Latin tableau in the double-3-tail staircase family has the three canonical column-symbol profiles (nine profiles before permuting the first three columns).
Statement
theorem latin_double_three_tail_profile_all (k : ℕ) (hk : 5 ≤ k) : ∀ T ∈ latin_tableaux (latin_double_three_tail_shape k), latin_double_three_tail_profile k T- 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
- 26 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- 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_tableauxFor a Young diagram μ, the set of Latin tableaux of shape μ and type μ' is the finset of fillings T from the cells of μ to natural numbers…
- latin_double_three_tail_profileThe proposed column profile: among the first three columns, two contain [1,k-1] and one contains [1,k-2] together with k; intermediate…
- latin_double_three_tail_profile_baseEvery Latin tableau of shape (5,4,3,3) has the specified column profile.
- latin_double_three_tail_shape_rowLen_succDeleting the top row of the shape at k+1 leaves the shape at k, with row indices shifted by one.
- 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…
- Used by 1
- latin_double_three_tail_four_extensionsConjecture: every Latin tableau of shape (k,k-1,...,4,3,3), k at least 5, extends in exactly four ways after adding the next top row of…
The proof, explained
The theorem is proved by mathematical induction on the staircase parameter $k \ge 5$ using `Nat.le_induction`. The base case $k = 5$ is supplied by the auxiliary lemma `latin_double_three_tail_profile_base`. The inductive step from $k$ to $k + 1$ is discharged by `latin_double_three_tail_profile_succ`, which carries the profile classification forward across the family.
It suffices to establish the profile property for the base case $k = 5$ and to show that the property propagates from $k$ to $k + 1$ for all $k \ge 5$.
We proceed by mathematical induction on $k \ge 5$ using `Nat.le_induction`, which splits the universal quantification over $k \ge 5$ into a base case at $k = 5$ and an inductive step from $k$ to $k + 1$.
uses
Nat.le_inductioninduction k, hk using Nat.le_induction with
Every Latin tableau of shape $\mu(5)$ satisfies the canonical column-symbol profile.
The base case $k = 5$ is discharged immediately by the lemma `latin_double_three_tail_profile_base`.
uses
latin_double_three_tail_profile_base| base => exact latin_double_three_tail_profile_baseFor any $k \ge 5$, if the canonical profile holds for all Latin tableaux of shape $\mu(k)$, it also holds for all Latin tableaux of shape $\mu(k+1)$.
The inductive step is established directly by applying `latin_double_three_tail_profile_succ` to the induction hypothesis `ih` and the condition $5 \le k$ (`hk`).
uses
latin_double_three_tail_profile_succ| succ k hk ih => exact latin_double_three_tail_profile_succ k hk ih
Nat.le_induction- The principle of mathematical induction for natural numbers with an arbitrary base value $m$: to prove $P(n)$ for all $n \ge m$, it suffices to prove the base case $P(m)$ and the step $P(n) \implies P(n+1)$ for every $n \ge m$.
latin_double_three_tail_profile_base- Every Latin tableau of the double-3-tail staircase shape of parameter 5 satisfies the canonical column-symbol profile.
latin_double_three_tail_profile_succ- For any $k \ge 5$, if every Latin tableau of the double-3-tail staircase shape of parameter $k$ satisfies the canonical profile, then every Latin tableau of parameter $k + 1$ also satisfies the canonical profile.
- The detailed combinatorial analysis classifying Latin tableaux of this shape is deferred to the auxiliary lemmas `latin_double_three_tail_profile_base` and `latin_double_three_tail_profile_succ`; this theorem connects them via mathematical induction.
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_profile_all (k : ℕ) (hk : 5 ≤ k) : ∀ T ∈ latin_tableaux (latin_double_three_tail_shape k), latin_double_three_tail_profile k T := by induction k, hk using Nat.le_induction with | base => exact latin_double_three_tail_profile_base | succ k hk ih => exact latin_double_three_tail_profile_succ k hk ih