Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 (i)–(iii) — a bipartite {1,2,3}\{1,2,3\}{1,2,3}-weighting with prescribed parities on RRR and sω=αs_\omega=\alphasω​=α on BBB

Proved
OneTwoThree.Weighting.lemma_5

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

1-2-3-conjecturebipartite-graphedge-weightinggraph-labellingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(V,E)G=(V,E)G=(V,E) be a finite connected bipartite graph with parts BBB and R=V∖BR=V\setminus BR=V∖B (every edge joins BBB to RRR). Let α:B→N\alpha:B\to\mathbb Nα:B→N satisfy

α(v)∈{2deg⁡(v)−1, 2deg⁡(v), 2deg⁡(v)+1}for all v∈B,\alpha(v)\in\{2\deg(v)-1,\ 2\deg(v),\ 2\deg(v)+1\}\qquad\text{for all }v\in B,α(v)∈{2deg(v)−1, 2deg(v), 2deg(v)+1}for all v∈B,

and let R′⊆RR'\subseteq RR′⊆R be such that ∣R′∣+∑v∈Bα(v)|R'|+\sum_{v\in B}\alpha(v)∣R′∣+∑v∈B​α(v) is even. Then there exists an edge-weighting ω:E→{1,2,3}\omega:E\to\{1,2,3\}ω:E→{1,2,3} such that

  1. sω(v)s_\omega(v)sω​(v) is even for all v∈R∖R′v\in R\setminus R'v∈R∖R′,
  2. sω(v)s_\omega(v)sω​(v) is odd for all v∈R′v\in R'v∈R′, and
  3. sω(v)=α(v)s_\omega(v)=\alpha(v)sω​(v)=α(v) for all v∈Bv\in Bv∈B.

The lemma weights the red-blue edges: blue vertices receive exactly the missing amount α(v)\alpha(v)α(v) and red vertices receive prescribed parities.

Formalization Note RRR is the complement of BBB and bipartiteness is the condition that every edge has exactly one end in BBB. α\alphaα is typed V→NV\to\mathbb NV→N, but only its values on BBB occur. The membership α(v)∈{2deg⁡(v)−1,2deg⁡(v),2deg⁡(v)+1}\alpha(v)\in\{2\deg(v)-1,2\deg(v),2\deg(v)+1\}α(v)∈{2deg(v)−1,2deg(v),2deg(v)+1} is stated in Z\mathbb ZZ, so no truncated subtraction appears; deg⁡\degdeg is the degree in GGG.

Preamble
import Mathlib
import Definitions.Def_OneTwoThree_Weighting_Setting
Formal statement
namespace OneTwoThree.Weighting

open Finset SimpleGraph

theorem lemma_5 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    [DecidableRel G.Adj] (hG : G.Connected) (B : Finset V)
    (hB : ∀ u v, G.Adj u v → (u ∈ B ↔ v ∉ B)) (α : V → ℕ)
    (hα : ∀ v ∈ B, (α v : ℤ) = 2 * (G.degree v : ℤ) - 1 ∨ (α v : ℤ) = 2 * (G.degree v : ℤ) ∨
      (α v : ℤ) = 2 * (G.degree v : ℤ) + 1)
    (R' : Finset V) (hR' : R' ⊆ Bᶜ) (hpar : Even (#R' + ∑ v ∈ B, α v)) :
    ∃ ω : Sym2 V → ℕ, IsWeighting G 3 ω ∧
      (∀ v ∈ Bᶜ \ R', Even (wdeg G ω v)) ∧
      (∀ v ∈ R', Odd (wdeg G ω v)) ∧
      (∀ v ∈ B, wdeg G ω v = α v) := by sorry

end OneTwoThree.Weighting
Source
Keusch, A Solution to the 1-2-3 Conjecture, arXiv:2303.02611v4, p. 6, Lemma 5 (i)–(iii)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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