OAI/Analysis/CircleDomains/Selection/CountableUncoveredTestEnds.lean
2 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.
- def
OAI.CircleDomainRigidity.uncoveredTestEndsline 20 - theorem
OAI.CircleDomainRigidity.countable_uncovered_test_endpointsline 24