Edges labelled in the cyclic model, residue class modulo
ProvedKnodelPrimeCordial.cyc_label_zero_count_mod0In residue class modulo twelve, exactly three quarters of the edges of the cyclic model receive label .
Let be a multiple of twelve and let be the labeling of the proof of Lemma 2.3. The cyclic model has edges: the cycle edges and the chords , all indices read modulo . Assign to each edge the label when and the label when . The claim is that
Role. This is one half of the prime-cordiality condition in residue class . Together with the corresponding count it gives , which is stronger than the required .
Formalization Note The graph is cyc n on Fin n and the edge set is edgesLabelZero (cyc n) f, a Finset of unordered pairs. The count covers cycle edges and chords at once, so no case split on the two edge families is needed at this level.
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_labelF
namespace KnodelPrimeCordial
theorem cyc_label_zero_count_mod0 (n : ℕ) (hn : 0 < n) (h12 : 12 ∣ n) :
(edgesLabelZero (cyc n) (fun i : Fin n => labelF i.val)).card = 3 * n / 4 := by sorry
end KnodelPrimeCordial