is_max_partial_transversal
Given a dimension δ : ℕ, an ambient finset of cells S in Fin δ × Fin δ, and a finset of cells T in Fin δ × Fin δ, is_max_partial_transversal S T asserts that T is a partial transversal of S, and for every finset T' in Fin δ × Fin δ that is a partial transversal of S, the cardinality of T' is at most the cardinality of T.
Statement
def is_max_partial_transversal {δ : ℕ} (S : Finset (Fin δ × Fin δ)) (T : Finset (Fin δ × Fin δ)) : Prop
- Defined in
- arXiv:2611.13961, Section 2
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- is_partial_transversalGiven a dimension δ : ℕ, an ambient finset of cells S in Fin δ × Fin δ, and a finset of cells T in Fin δ × Fin δ, is_partial_transversal S…
Read back from the Lean
Given a natural number δ and finite sets S, T of pairs in Fin δ × Fin δ, is_max_partial_transversal S T asserts that T is a partial transversal of S (meaning T ⊆ S, no two distinct elements of T have the same first component, and no two distinct elements of T have the same second component), and for every finite set T' of pairs in Fin δ × Fin δ, if T' is also a partial transversal of S, then the cardinality of T' is at most the cardinality of T. In other words, T is a maximum-cardinality partial transversal of S.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A partial transversal T of S is maximum if no partial transversal of S has strictly greater cardinality. -/ def is_max_partial_transversal {δ : ℕ} (S : Finset (Fin δ × Fin δ)) (T : Finset (Fin δ × Fin δ)) : Prop := is_partial_transversal S T ∧ ∀ T' : Finset (Fin δ × Fin δ), is_partial_transversal S T' → T'.card ≤ T.card