Assemble offset-two coprime counts by index residue
ProvedKnodelPrimeCordial.case_mod_6_offset_2_residue_assembly__p2m_7532f8d4_700d_4daa_ba77_23877d6e6e87_a1graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial
If the six residue-class counts have the stated values, their disjoint union has the target count. Prove by partitioning Fin (n / 2) according to j.val % 6 and simplifying the resulting arithmetic.
Preamble
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_knodel import Definitions.Def_KnodelPrimeCordial_labelF
Formal statement
theorem KnodelPrimeCordial.case_mod_6_offset_2_residue_assembly__p2m_7532f8d4_700d_4daa_ba77_23877d6e6e87_a1
(n : ℕ) (hn : Even n) (h10 : 10 ≤ n) (hmod : n % 12 = 6)
(h0 : (Finset.univ.filter fun j : Fin (n / 2) =>
j.val % 6 = 0 ∧ Nat.Coprime
(KnodelPrimeCordial.labelF (2 * j.val))
(KnodelPrimeCordial.labelF
((2 * ((j.val + 2 ^ 2 - 1) % (n / 2)) + n - 1) % n))).card = 0)
(h1 : (Finset.univ.filter fun j : Fin (n / 2) =>
j.val % 6 = 1 ∧ Nat.Coprime
(KnodelPrimeCordial.labelF (2 * j.val))
(KnodelPrimeCordial.labelF
((2 * ((j.val + 2 ^ 2 - 1) % (n / 2)) + n - 1) % n))).card = n / 12 + 1)
(h2 : (Finset.univ.filter fun j : Fin (n / 2) =>
j.val % 6 = 2 ∧ Nat.Coprime
(KnodelPrimeCordial.labelF (2 * j.val))
(KnodelPrimeCordial.labelF
((2 * ((j.val + 2 ^ 2 - 1) % (n / 2)) + n - 1) % n))).card = 1)
(h3 : (Finset.univ.filter fun j : Fin (n / 2) =>
j.val % 6 = 3 ∧ Nat.Coprime
(KnodelPrimeCordial.labelF (2 * j.val))
(KnodelPrimeCordial.labelF
((2 * ((j.val + 2 ^ 2 - 1) % (n / 2)) + n - 1) % n))).card = 0)
(h4 : (Finset.univ.filter fun j : Fin (n / 2) =>
j.val % 6 = 4 ∧ Nat.Coprime
(KnodelPrimeCordial.labelF (2 * j.val))
(KnodelPrimeCordial.labelF
((2 * ((j.val + 2 ^ 2 - 1) % (n / 2)) + n - 1) % n))).card = n / 12)
(h5 : (Finset.univ.filter fun j : Fin (n / 2) =>
j.val % 6 = 5 ∧ Nat.Coprime
(KnodelPrimeCordial.labelF (2 * j.val))
(KnodelPrimeCordial.labelF
((2 * ((j.val + 2 ^ 2 - 1) % (n / 2)) + n - 1) % n))).card = n / 12) :
(Finset.univ.filter fun j : Fin (n / 2) =>
Nat.Coprime
(KnodelPrimeCordial.labelF (2 * j.val))
(KnodelPrimeCordial.labelF
((2 * ((j.val + 2 ^ 2 - 1) % (n / 2)) + n - 1) % n))).card =
(n + 2) / 4 := by sorrySource
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.3, p.3 (PDF p.3); proof pp.4–6