AFTD Auto-Formalizing Theoretical Domains

latin_double_three_tail_profile_all

theoremverified

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
Used by 1

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.

  1. 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$.

    line 2

    uses Nat.le_induction

      induction k, hk using Nat.le_induction with
  2. 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`.

    line 3

    uses latin_double_three_tail_profile_base

      | base => exact latin_double_three_tail_profile_base
  3. For 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`).

    line 4

    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.

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