OAI/Analysis/CircleDomains/Probability/PriorLawPresentation.lean
2 declarations, 0 contain sorry, 0 declared as axioms
The countable data attached to a recursion stage: every earlier law is retained, its hit support has finite deletions, and every required dust mark is among the marks prescribed to the next positive-law construction.
- structure
OAI.CircleDomainRigidity.PriorLawPresentationline 17 - theorem
OAI.CircleDomainRigidity.nonempty_priorLawPresentationline 33