Bounding an integral homology ball is decidable
OpenHomologySpheresBoundBalls.hsbb_goal_int_decidablePresent a closed 3-manifold by a finite simplicial complex : a list of simplices, each a list of vertex labels in , with geometric realization . There is a computable function from such lists to such that for every whose realization is an integral homology 3-sphere,
This formalizes the question is there a complete and computable set of invariants that can determine which homology 3-spheres bound homology 4-balls? A complete computable invariant yields such a decision procedure, and conversely is itself a complete computable invariant. The problem is open; a proof of the negation would also settle it.
Formalization Note. "Computable" is Mathlib's Computable (partial recursive, total). The behaviour of on complexes that are not integral homology 3-spheres is unconstrained.
import Definitions.Def_hsbb_homology_balls import Definitions.Def_hsbb_spaces open scoped Manifold
namespace HomologySpheresBoundBalls
/-- **Goal.** There is an algorithm which, given a finite simplicial complex `K` whose
realization is an integral homology 3-sphere, decides whether `|K|` bounds a smooth
integral homology 4-ball. -/
theorem hsbb_goal_int_decidable :
∃ f : List (List ℕ) → Bool, Computable f ∧
∀ K : List (List ℕ), IsIntHomology3Sphere (realization K) →
(f K = true ↔ BoundsIntHomologyBall (realization K)) := by sorry
end HomologySpheresBoundBallsConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.