AFTD Auto-Formalizing Theoretical Domains

mem_latin_double_three_tail_shape

theoremverified

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

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`.

  1. (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)`.

    lines 3–5

    uses Finset.mem_filter, Finset.mem_product, Finset.mem_range

      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]
  2. (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.

    line 6

      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

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
See it in the graphDiscuss this resultChallenge it