Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A three-port pairing lemma for the 5-cycle

Proved
c5_three_port_pairing

by hao jia · Sep 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-combinatoricsgraph-theory

Let C₅ be the cycle on five vertices, indexed by Fin 5, with adjacency between consecutive indices modulo 5. Choose distinct nonadjacent vertices u and v, and let T be the other three vertices. For any reserved vertex r in T, the other four vertices can be covered by two disjoint edges of C₅ such that each edge has exactly one endpoint in T.

This is a finite local pairing lemma only; it makes no claim about extending the pairing to a larger graph or proving a global P₃-factor. No novelty claim is asserted.

Preamble
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Fintype.Basic
import Mathlib.Data.Finset.Basic
Formal statement
theorem c5_three_port_pairing :
    ∀ (u v r : Fin 5),
      u ≠ v →
      ¬ ((u.val + 1) % 5 = v.val ∨ (v.val + 1) % 5 = u.val) →
      let T : Finset (Fin 5) := (Finset.univ.erase u).erase v
      r ∈ T →
      ∃ (a b c d : Fin 5),
        a ≠ b ∧ a ≠ c ∧ a ≠ d ∧ b ≠ c ∧ b ≠ d ∧ c ≠ d ∧
        ((a.val + 1) % 5 = b.val ∨ (b.val + 1) % 5 = a.val) ∧
        ((c.val + 1) % 5 = d.val ∨ (d.val + 1) % 5 = c.val) ∧
        ({a, b, c, d} : Finset (Fin 5)) = Finset.univ.erase r ∧
        ((a ∈ T ∧ b ∉ T) ∨ (a ∉ T ∧ b ∈ T)) ∧
        ((c ∈ T ∧ d ∉ T) ∨ (c ∉ T ∧ d ∈ T)) := by sorry
Source
Original finite local derivation; no external source or novelty claim is asserted.

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