Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Casson–Harer: Brieskorn families bounding contractible 4-manifolds

Open
HomologySpheresBoundBalls.hsbb_casson_harer_brieskorn

by Lucas · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

4-manifoldsbrieskorn-spherestopology

The following Brieskorn homology spheres bound compact smooth contractible 4-manifolds:

  1. Σ(p, ps−1, ps+1)\Sigma(p,\ ps-1,\ ps+1)Σ(p, ps−1, ps+1) for p≥2p \ge 2p≥2 even and sss odd;
  2. Σ(p, ps+1, ps+2)\Sigma(p,\ ps+1,\ ps+2)Σ(p, ps+1, ps+2) and Σ(p, ps−1, ps−2)\Sigma(p,\ ps-1,\ ps-2)Σ(p, ps−1, ps−2) for p≥3p \ge 3p≥3 odd and s≥1s \ge 1s≥1.

These infinite families show that bounding a contractible (hence an integral homology) ball is common among Brieskorn spheres.

Formalization Note. The bounds p≥2p \ge 2p≥2, p≥3p \ge 3p≥3, s≥1s \ge 1s≥1 only exclude degenerate parameters and keep natural-number subtraction from truncating.

Preamble
import Definitions.Def_hsbb_homology_balls
import Definitions.Def_hsbb_spaces

open scoped Manifold
Formal statement
namespace HomologySpheresBoundBalls

/-- (Casson–Harer) `Σ(p, ps-1, ps+1)` for `p` even and `s` odd, and `Σ(p, ps±1, ps±2)` for
`p` odd, bound smooth contractible 4-manifolds. -/
theorem hsbb_casson_harer_brieskorn :
    (∀ p s : ℕ, 2 ≤ p → Even p → Odd s →
      BoundsContractible (BrieskornSphere p (p * s - 1) (p * s + 1))) ∧
    (∀ p s : ℕ, 3 ≤ p → Odd p → 1 ≤ s →
      BoundsContractible (BrieskornSphere p (p * s + 1) (p * s + 2)) ∧
      BoundsContractible (BrieskornSphere p (p * s - 1) (p * s - 2))) := by sorry

end HomologySpheresBoundBalls
Source
Open Problem Garden, 'Which homology 3-spheres bound homology 4-balls?' (rybu, 2009), http://www.openproblemgarden.org/op/which_homology_3_spheres_bound_homology_4_balls
Human review
  • Endorsed by Shuze Chen · Oct 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 11, 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