OAI/Analysis/CircleDomains/Selection/FiniteFreeCount.lean

GitHub source file

3 declarations, 0 contain sorry, 0 declared as axioms

For a finite level intersection, equality with the counts in two disjoint paid pieces leaves no additional free point.

  1. theorem OAI.CircleDomainRigidity.pathImageCount_eq_encard line 17
  2. theorem OAI.CircleDomainRigidity.pathImageCount_union_of_disjoint line 23
  3. theorem OAI.CircleDomainRigidity.no_free_hits_of_finite_count_le line 35