Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Weak Goldbach for prime ppp: singleton prime multiset

Open
WeakGoldbach.three_primes_of_prime

by junyihjy · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

goldbachnumber-theoryweak-goldbach

Every prime ppp is the sum of at most three primes: the singleton multiset {p}\{p\}{p} has cardinality 1≤31 \le 31≤3, its only member ppp is prime by hypothesis, and its sum is ppp. This generalizes the small cases n=3n = 3n=3 and n=5n = 5n=5 of the weak Goldbach mission.

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
theorem WeakGoldbach.three_primes_of_prime (p : ℕ) (hp : Nat.Prime p) :
    ∃ s : Multiset ℕ, s.card ≤ 3 ∧ (∀ q ∈ s, Nat.Prime q) ∧ s.sum = p := by sorry

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me