The Lemma 2.3 labeling is a bijection in residue class modulo
ProvedKnodelPrimeCordial.labelF_cyc_bijective_mod0For every positive multiple of twelve, the explicit labeling used in the proof of Lemma 2.3 is a bijection from the vertices of the cyclic model onto .
Let be the labeling of the paper Prime cordial labeling of Knödel graph (Haque, Khanam, Shahriar, 2026), proof of Lemma 2.3, defined on indices by
When is a positive multiple of twelve, the map sends bijectively onto .
Role. This is the bijectivity half of the prime-cordiality requirement. It is used together with the edge counts in residue class to establish prime cordiality there.
Formalization Note Indices are Fin n and the labeling is labelF. The conclusion is Set.BijOn onto Set.Icc 1 n. The proof rests on the block structure of labelF: on each block of twelve consecutive indices it shifts the block by one, mapping onto .
import Mathlib import Definitions.Def_KnodelPrimeCordial_IsPrimeCordialLabeling import Definitions.Def_KnodelPrimeCordial_cyc import Definitions.Def_KnodelPrimeCordial_labelF
namespace KnodelPrimeCordial
theorem labelF_cyc_bijective_mod0 (n : ℕ) (hn : 0 < n) (h12 : 12 ∣ n) :
Set.BijOn (fun i : Fin n => labelF i.val) Set.univ (Set.Icc 1 n) := by sorry
end KnodelPrimeCordial