AFTD Auto-Formalizing Theoretical Domains

latin_double_three_tail_four_extensions

theoremverifiedoriginal

Conjecture: 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 length k+1.

Statement

theorem latin_double_three_tail_four_extensions (k : ℕ) (hk : 5 ≤ k) : ∀ T ∈ latin_tableaux (latin_double_three_tail_shape k), Matrix.permanent (latin_top_row_availability (latin_double_three_tail_shape k) T (k+1)) = 4
Related work
Proposed here as a pointwise four-extension refinement of the open counting question in https://arxiv.org/html/2610.29291v1, Conjecture 6.3. The baseline availability-permanent identity is Lemma 5.4; top-row monotonicity is Proposition 5.5. Exact evidence and the column-profile mechanism: experiments 4100, 4103 and 4106.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
  • 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_top_row_availabilityThe zero-one matrix whose row index is a prospective symbol minus one and whose column index is a column: an entry is one precisely when…
  • 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_permanent_of_profileA filling with the canonical column profile has exactly four legal permutations for a new top row of length k+1.
Used by 1

Read back from the Lean

For any natural number $k \ge 5$, and for every Latin tableau $T$ of the Young diagram shape latin_double_three_tail_shape k, the permanent of the $(k+1) \times (k+1)$ top-row availability matrix associated to $T$ is equal to 4.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

For any k ≥ 5, the number of ways to extend a Latin tableau of shape (k, k-1, ..., 4, 3, 3) by adding a top row of length k + 1 equals the permanent of its top-row availability matrix. The proof establishes that this permanent is 4 in two steps. It first invokes a classification result showing that every Latin tableau of this shape satisfies a specific column profile, and then applies a lemma showing that any tableau with this profile has permanent 4.

  1. Let T be an arbitrary Latin tableau of shape latin_double_three_tail_shape k.

    We introduce the arbitrary tableau T and the hypothesis hT that T belongs to the set of Latin tableaux of shape latin_double_three_tail_shape k.

    line 2

      intro T hT
  2. The permanent of the top-row availability matrix of T for length k + 1 is 4.

    By latin_double_three_tail_profile_all, any such Latin tableau T satisfies the profile condition latin_double_three_tail_profile k T. Then, latin_double_three_tail_permanent_of_profile states that any tableau satisfying this profile condition has an availability matrix with permanent equal to 4.

    line 3

    uses latin_double_three_tail_permanent_of_profile, latin_double_three_tail_profile_all

      exact latin_double_three_tail_permanent_of_profile k hk T (latin_double_three_tail_profile_all k hk T hT)
latin_double_three_tail_permanent_of_profile
For k ≥ 5, any tableau of shape latin_double_three_tail_shape k satisfying the condition latin_double_three_tail_profile k T has a top-row availability matrix of size k + 1 whose permanent equals 4.
latin_double_three_tail_profile_all
For k ≥ 5, every Latin tableau of shape latin_double_three_tail_shape k satisfies the condition latin_double_three_tail_profile k T.

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 latin_double_three_tail_four_extensions (k : ℕ) (hk : 5 ≤ k) : ∀ T ∈ latin_tableaux (latin_double_three_tail_shape k), Matrix.permanent (latin_top_row_availability (latin_double_three_tail_shape k) T (k+1)) = 4 := by  intro T hT  exact latin_double_three_tail_permanent_of_profile k hk T (latin_double_three_tail_profile_all k hk T hT)
See it in the graphDiscuss this resultChallenge it