putnam-v1 / putnam-1962-a1

putnam-1962-a1

open
difficulty 4
credited
Run this goal:./swarm/run.sh --goal putnam-1962-a1

What it runs

The Lean statement the swarm must prove — kernel-verified at Gate A. The trailing sorry is the open obligation a proof replaces.

goals/putnam-1962-a1.lean
import Mathlib

open MeasureTheory

theorem putnam_1962_a1 (S : Set (ℝ × ℝ))
(hS : S.ncard = 5)
(hnoncol : ∀ s ⊆ S, s.ncard = 3 → ¬Collinear ℝ s)
: ∃ T ⊆ S, T.ncard = 4 ∧ ¬∃ t ∈ T, t ∈ convexHull ℝ (T \ {t}) := by
  sorry

Decomposition — helper lemmas

The swarm split this goal into helper sub-lemmas, proved them separately, and composed them back into the parent proof (unsorry ADR-009). Decomposed by rauxon-3.

Runs (1)

GoalContributorModelDate (UTC)TimeResultVerification
putnam-1962-a1Rauxonclaude/opus2026-06-25 05:3194m 37s
decomposed