Adjacent edges labelled in residue class modulo
OpenKnodelPrimeCordial.cyc_adj_label_zero_count_mod0In residue class modulo twelve, exactly half of the cycle edges of the cyclic model receive label .
Let be a multiple of twelve, and let be the labeling of Lemma 2.3. The cyclic model has the cycle edges (indices read modulo ). An edge receives label when and are not coprime. The claim is that
Role. This is one of the two counting ingredients for residue class ; combined with the chord count it gives the total required by the prime-cordiality condition.
Formalization Note The condition i ranges over Fin n and the successor is (i.val + 1) % n, so the last edge wraps. The count is a Finset filter over Fin n.
Retired. This node split the edge count by edge family (cycle edges versus chords), which required a further decomposition lemma for the edge set and left the statement disconnected from the mission tree. It is replaced by KnodelPrimeCordial.cyc_label_zero_count_mod0 / KnodelPrimeCordial.cyc_label_one_count_mod0, which state the same arithmetic directly over the whole edge set of the cyclic model and are children of case_mod_0_cyc_cordial.
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_labelF
namespace KnodelPrimeCordial
theorem cyc_adj_label_zero_count_mod0 (n : ℕ) (hn : 0 < n) (h12 : 12 ∣ n) :
(Finset.univ.filter (fun i : Fin n =>
1 < Nat.gcd (labelF i.val) (labelF ((i.val + 1) % n)))).card = n / 2 := by sorry
end KnodelPrimeCordial