OAI/Analysis/CircleDomains/Probability/CodeLawCandidateBounds.lean

GitHub source file

3 declarations, 0 contain sorry, 0 declared as axioms

The quantitative outputs of countable modulus extraction are members of one fixed candidate family, independent of the prescribed countable set.

  1. theorem OAI.CircleDomainRigidity.meanVisitCount_codePathLaw_eq_integral line 24
  2. theorem OAI.CircleDomainRigidity.countableSquareLawBounds_of_visit_norm line 36
  3. theorem OAI.CircleDomainRigidity.codeLawCandidate_of_extracted_bounds line 50