AFTD Auto-Formalizing Theoretical Domains

is_four_partition

def

Given a finite type V with decidable equality and four finite subsets A, B, C, D : Finset V, is_four_partition A B C D is the proposition that A, B, C, D are pairwise disjoint and their union is the universal finset.

Statement

def is_four_partition {V : Type*} [Fintype V] [DecidableEq V]
    (A B C D : Finset V) : Prop
Defined in
folklore
Verified
01 Nov 2026
Axioms
none listed
Used by 3
  • path_cut_word_odd_run_ineqFor a four-partition A,B,C,D of the vertices of the path P_n, the sum of the numbers of maximal odd-length crossing runs for A, B, C and D…
  • square_grid_coloring_is_four_partitionFor any natural number n and any four-coloring c : Fin n × Fin n → Fin 4, the four color classes of c are pairwise disjoint and their…
  • path_cut_word_count_cancelFor a four-partition A,B,C,D of the vertices of the path P_n, the total number of edges crossing the cuts defined by A, B, C, D equals the…

Read back from the Lean

For a finite type V with decidable equality, and four finite subsets A, B, C, D : Finset V, is_four_partition A B C D asserts that A, B, C, and D are pairwise disjoint (A is disjoint from B, C, and D; B is disjoint from C and D; C is disjoint from D) and their union A ∪ B ∪ C ∪ D equals the universal finset Finset.univ.

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 four-partition of the vertices of a finite type, allowing empty parts. -/
def is_four_partition {V : Type*} [Fintype V] [DecidableEq V]
    (A B C D : Finset V) : Prop := Disjoint A B ∧ Disjoint A C ∧ Disjoint A D ∧
  Disjoint B C ∧ Disjoint B D ∧ Disjoint C D ∧
  A ∪ B ∪ C ∪ D = Finset.univ
See it in the graphDiscuss this resultChallenge it