Vela

erdős #505 · Borsuk's problem

← #504 · #506 (packet.json; erdosproblems.com)

Is every set of diameter in the union of at most sets of diameter ?

Worked, still open.

geometry · solved · possible · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

formal

AMS 52 · test (literature)

theorem erdos_505.test_dim_one
    (S : Set (EuclideanSpace ℝ (Fin 1)))
    (hS : Bornology.IsBounded S) (hd : 0 < diam S) :
    ∃ (F : Fin 2 → Set (EuclideanSpace ℝ (Fin 1))),
      S ⊆ ⋃ i, F i ∧ ∀ i, diam (F i) < diam S
formal-conjectures/505.lean ↗

Borsuk's problem · reference

status

solved

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 5a1f97506fa1afab552e8ac8c5a73c5672e0abfef62240127946f5a785b2b90e

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.