mem_latin_double_three_tail_shape
A cell (i,j) belongs to the double-3-tail shape exactly when i < k-1 and j < max(3,k-i).
Statement
theorem mem_latin_double_three_tail_shape (k i j : ℕ) :
(i,j) ∈ latin_double_three_tail_shape k ↔ i < k - 1 ∧ j < max 3 (k - 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 1
- 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…
- Used by 7
- latin_double_three_tail_profile_baseEvery Latin tableau of shape (5,4,3,3) has the specified column profile.
- 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_tableaux_shape5_first_three_colsIn every Latin tableau of shape (5,4,3,3), among the first three columns, exactly one column contains symbols {1,2,3,5} and the other two…
- 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…
- latin_double_three_tail_count_baseThere are exactly 144 Latin tableaux of shape (5,4,3,3).
- latin_tableaux_shape5_tail_colsIn every Latin tableau of shape (5,4,3,3), column 4 contains a singleton {s} with s ∈ {1,2,3}, and column 3 contains {1,2,3} \ {s}.
- latin_double_three_tail_shape_rowLenThe row-length sanity formula for the staircase with two bottom rows of length three.
The proof, explained
The proof unfolds the definition of `latin_double_three_tail_shape k` as a filtered Cartesian product of range sets and rewrites diagram membership into linear inequalities. The `omega` tactic then completes the proof by recognizing that the bound `j < max k 3` is redundant, since `k - i ≤ k` ensures `max 3 (k - i) ≤ max k 3`.
(i, j) ∈ latin_double_three_tail_shape k ↔ (i < k - 1 ∧ j < max k 3) ∧ j < max 3 (k - i)
By definition, the cells of the Young diagram `latin_double_three_tail_shape k` are the elements of the Cartesian product `Finset.range (k - 1) ×ˢ Finset.range (max k 3)` that satisfy the condition that their second coordinate is strictly less than `max 3 (k - first coordinate)`. Unfolding this definition (`change`) and simplifying membership in the filtered product using `Finset.mem_filter`, `Finset.mem_product`, and `Finset.mem_range` turns the membership condition into the conjunction of bounds `(i < k - 1 ∧ j < max k 3) ∧ j < max 3 (k - i)`.
uses
Finset.mem_filter,Finset.mem_product,Finset.mem_rangechange ((i,j) ∈ ((Finset.range (k - 1)) ×ˢ Finset.range (max k 3)).filter (fun c => c.2 < max 3 (k - c.1))) ↔ _ simp only [Finset.mem_filter, Finset.mem_product, Finset.mem_range]
(i, j) ∈ latin_double_three_tail_shape k ↔ i < k - 1 ∧ j < max 3 (k - i) automation
The condition `j < max k 3` is redundant. Since `k - i ≤ k`, we have `max 3 (k - i) ≤ max 3 k = max k 3`. Therefore, `j < max 3 (k - i)` already implies `j < max k 3`. The Presburger arithmetic decision procedure `omega` detects this redundancy and simplifies the equivalence.
omega
Finset.mem_filter- An element belongs to a filtered finset `Finset.filter p s` if and only if it belongs to `s` and satisfies the predicate `p`.
Finset.mem_product- An ordered pair belongs to the Cartesian product `s ×ˢ t` if and only if its first component is in `s` and its second component is in `t`.
Finset.mem_range- A natural number `m` belongs to `Finset.range n` if and only if `m < n`.
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 mem_latin_double_three_tail_shape (k i j : ℕ) : (i,j) ∈ latin_double_three_tail_shape k ↔ i < k - 1 ∧ j < max 3 (k - i) := by change ((i,j) ∈ ((Finset.range (k - 1)) ×ˢ Finset.range (max k 3)).filter (fun c => c.2 < max 3 (k - c.1))) ↔ _ simp only [Finset.mem_filter, Finset.mem_product, Finset.mem_range] omega