mem_latin_column_symbols
A symbol belongs to a column-symbol set exactly when a cell of that column has that value.
Statement
theorem mem_latin_column_symbols (d : YoungDiagram) (T : d.cells → ℕ) (j x : ℕ) :
x ∈ latin_column_symbols d T j ↔ ∃ c : d.cells, c.val.2 = j ∧ T c = x- 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_column_symbolsThe finite set of symbols appearing in column j of a fixed filling T of a Young diagram d.
- Used by 6
- latin_double_three_tail_profile_baseEvery Latin tableau of shape (5,4,3,3) has the specified column profile.
- 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_permanent_of_profileA filling with the canonical column profile has exactly four legal permutations for a new top row of length k+1.
- 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_top_row_availability_eq_one_iffThe availability entry equals one exactly when the prospective positive symbol does not already occur in that column.
The proof, explained
The theorem states that a number x belongs to the column-symbol set for column j if and only if some cell in that column has value x under the filling T. By definition, latin_column_symbols is the image under T of the cells of the Young diagram whose column index is j. The proof unfolds this definition and uses the simplifier to reduce membership in the image of a filtered finset to the existential statement.
x belongs to latin_column_symbols d T j if and only if there is a cell c of d with column index j such that T(c) = x automation
Unfolding the definition of latin_column_symbols expresses the column symbols as the image under T of the cells of d whose second coordinate is j. The simplifier automatically evaluates membership in the image of this filtered finset, reducing it to the existence of a cell c in d with column index j and value T(c) = x.
uses
latin_column_symbolssimp [latin_column_symbols]
latin_column_symbols- The finset of symbols in column j of the Young diagram d under the filling T, defined as the image under T of all cells of d whose second coordinate equals j.
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_column_symbols (d : YoungDiagram) (T : d.cells → ℕ) (j x : ℕ) : x ∈ latin_column_symbols d T j ↔ ∃ c : d.cells, c.val.2 = j ∧ T c = x := by simp [latin_column_symbols]