Back to Problems

convex_mosers_worm_problem_bound_attained

Specification

The minimal area of a convex shape that can cover every unit-length curve is attained. This follows from the Blaschke selection theorem.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem convex_mosers_worm_problem_bound_attained :
    ∃ bound, IsLeast {v | ∃ X ∈ WormCovers, Convex ℝ X ∧ volume X = v} bound
ID: Wikipedia__MoserWorm__convex_mosers_worm_problem_bound_attained
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.