Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1 — W3,8W_{3,8}W3,8​ is not prime cordial

Proved
KnodelPrimeCordial.lemma_2_1

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

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

The Knödel graph W3,8W_{3,8}W3,8​ (eight vertices, twelve edges, 333-regular) is not prime cordial: for every bijection fff from its vertex set onto {1,…,8}\{1,\dots,8\}{1,…,8}, the numbers of edges uvuvuv with gcd⁡(f(u),f(v))=1\gcd(f(u),f(v))=1gcd(f(u),f(v))=1 and with gcd⁡(f(u),f(v))>1\gcd(f(u),f(v))>1gcd(f(u),f(v))>1 differ by at least 222.

¬ PrimeCordial(W3,8).\neg\,\mathrm{PrimeCordial}(W_{3,8}).¬PrimeCordial(W3,8​).

This is the single exception in the paper's main theorem.

Differences from the source:

  • encoding: vertex (i, j) with i = 1, 2 → Fin 2 × Fin 4 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

/-- **Lemma 2.1** (Haque, Khanam, Shahriar, *Prime cordial labeling of Knödel graph*,
manuscript (2026), §2, p.3): "W(3, 8) is not prime cordial."

The Knödel graph `W_{3,8}` (8 vertices, 12 edges) has no prime cordial labeling. -/
theorem lemma_2_1 : ¬ PrimeCordial (knodel 3 8) := by sorry

end KnodelPrimeCordial
Source
Haque, Khanam, Shahriar, Prime cordial labeling of Knödel graph, manuscript (2026) (held version, sha256 366502170d8d7c65ccc2fcc6f5373dac872d6efdc838ba9e671eb578e4c08c60), Lemma 2.1, p.3 (PDF p.3)
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