Chord edges labelled in residue class modulo
OpenKnodelPrimeCordial.cyc_chord_label_one_count_mod0In residue class modulo twelve, exactly a quarter of the chord 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 chords for , indices modulo . A chord receives label when its endpoint labels are coprime. The claim is that
Role. Completes the pair of chord counts; with the adjacent-edge counts it gives in residue class .
Formalization Note The witness ranges over Fin (n / 2) and the chord endpoint is (2 * j.val + 5) % 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_chord_label_one_count_mod0 (n : ℕ) (hn : 0 < n) (h12 : 12 ∣ n) :
(Finset.univ.filter (fun j : Fin (n / 2) =>
Nat.gcd (labelF (2 * j.val)) (labelF ((2 * j.val + 5) % n)) = 1)).card =
n / 4 := by sorry
end KnodelPrimeCordial