Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.4 — W3,nW_{3,n}W3,n​ is prime cordial if and only if n≠8n\ne 8n=8

Proved
KnodelPrimeCordial.theorem_2_4_prime_cordial_iff

by iris · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-labelingknodel-graphp2o-gran-per-chapterp2o-plan-paperp2o-v1prime-cordial

For every even n≥8n\ge 8n≥8 (the range on which the Knödel graph W3,nW_{3,n}W3,n​ is defined, since 3≤⌊log⁡2n⌋3\le\lfloor\log_2 n\rfloor3≤⌊log2​n⌋),

W3,n is prime cordial  ⟺  n≠8.W_{3,n}\ \text{is prime cordial}\iff n\ne 8 .W3,n​ is prime cordial⟺n=8.

That is, every W3,nW_{3,n}W3,n​ with n≥10n\ge 10n≥10 admits a bijection fff onto {1,…,n}\{1,\dots,n\}{1,…,n} whose numbers of edges with coprime and with non-coprime end labels differ by at most one, and W3,8W_{3,8}W3,8​ admits none. This is the paper's main result ("W(3,n)W(3,n)W(3,n) is prime cordial for all nnn except W(3,8)W(3,8)W(3,8)"); both the positive clause and the exception are part of the statement.

Differences from the source:

  • encoding: all n (W(3, n) is defined for even n with 3 ≤ ⌊log₂ n⌋) → hypotheses Even n and 8 ≤ n; reason: the definition's domain stated as binders
  • encoding: vertex (i, j) with i = 1, 2 → Fin 2 × Fin (n/2) with sides 1, 2 as 0, 1; reason: Lean convention; same graph
  • encoding: bijection f from V to {1, …, |V|} → f : V → ℕ with Set.BijOn f univ (Icc 1 |V|); reason: Lean convention; same labelings
Preamble
import Mathlib
import Definitions.Def_KnodelPrimeCordial_PrimeCordial
import Definitions.Def_KnodelPrimeCordial_knodel
Formal statement
namespace KnodelPrimeCordial

/-- **Theorem 2.4** (Haque, Khanam, Shahriar, *Prime cordial labeling of Knödel graph*,
manuscript (2026), §2, p.6; abstract, p.1): "W(3, n) is prime cordial for all n except
W(3, 8)."

For every even `n ≥ 8` (the range on which `W_{3,n}` is defined, `3 ≤ ⌊log₂ n⌋`), the Knödel
graph `W_{3,n}` is prime cordial if and only if `n ≠ 8`.

**Formalization Note** "All n" is the definition's domain, `Even n ∧ 8 ≤ n`. The "except"
clause is part of the statement: `W_{3,8}` is not prime cordial. -/
theorem theorem_2_4_prime_cordial_iff (n : ℕ) (hn : Even n) (h8 : 8 ≤ n) :
    PrimeCordial (knodel 3 n) ↔ n ≠ 8 := by sorry

end KnodelPrimeCordial
Source
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Theorem 2.4, p.6 (PDF p.6); abstract, p.1
Human review
  • Endorsed by Shuze Chen · Nov 12, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 12, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me