AFTD Auto-Formalizing Theoretical Domains

latin_double_three_tail_profile_last_column_card

theoremverified

A profile has exactly one distinct symbol in its last column, as required by the one-cell last column of the shape.

Statement

theorem latin_double_three_tail_profile_last_column_card (k : ℕ)
    (T : (latin_double_three_tail_shape k).cells → ℕ)
    (h : latin_double_three_tail_profile k T) :
    (latin_column_symbols (latin_double_three_tail_shape k) T (k - 1)).card = 1
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 3
  • 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_column_symbolsThe finite set of symbols appearing in column j of a fixed filling T of a Young diagram d.
  • 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…

The proof, explained

The theorem states that for any filling T satisfying the double-three tail profile, column k - 1 contains exactly one distinct symbol. Unpacking the profile definition reveals that the set of symbols in column k - 1 is explicitly specified to be the singleton {s} for some s ∈ {1, 2, 3}. Rewriting the column symbol set with this singleton reduces the goal to showing |{s}| = 1, which holds immediately.

  1. The set of symbols in column k - 1 is the singleton {s} for some symbol s ∈ {1, 2, 3}.

    We unpack the hypothesis h that T has a double-three tail profile. By definition of `latin_double_three_tail_profile`, there exist parameters including a symbol s ∈ {1, 2, 3} and a condition (`hlast`) asserting that the set of symbols appearing in column k - 1 is precisely the singleton {s}.

    line 5

      obtain ⟨s, hs, c, hc, hfirst, hmid, hpair, hlast⟩ := h
  2. The cardinality of the set of symbols in column k - 1 is 1.

    Rewriting the set of column symbols using `hlast` replaces the set with {s}, reducing the goal to |{s}| = 1. The simplifier computes the cardinality of this singleton set to be 1, completing the proof.

    lines 6–7

      rw [hlast]
      simp

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_last_column_card (k : ℕ)    (T : (latin_double_three_tail_shape k).cells → ℕ)    (h : latin_double_three_tail_profile k T) :    (latin_column_symbols (latin_double_three_tail_shape k) T (k - 1)).card = 1 := by  obtain ⟨s, hs, c, hc, hfirst, hmid, hpair, hlast⟩ := h  rw [hlast]  simp
See it in the graphDiscuss this resultChallenge it