OAI/Analysis/CircleDomains/Selection/CountableUncoveredSeededEnds.lean

GitHub source file

1 declarations, 0 contain sorry, 0 declared as axioms

The greedy selection of tests misses only countably many ends at each accuracy, by the positive-law recursion and alternating disk crossings.

  1. theorem OAI.CircleDomainRigidity.countable_uncovered_test_endpoints_of_range line 19