OAI/Analysis/CircleDomains/Selection/FiniteChainPotential.lean
16 declarations, 0 contain sorry, 0 declared as axioms
The finite-chain infimum used in the compatible barrier construction. Costs may be infinite. In particular, truncation remains valid on components unreachable by finite-cost chains.
- inductive
OAI.CircleDomainRigidity.PaidChainline 19 - theorem
OAI.CircleDomainRigidity.PaidChain.singleline 28 - theorem
OAI.CircleDomainRigidity.PaidChain.appendline 31 - theorem
OAI.CircleDomainRigidity.PaidChain.reverseline 37 - def
OAI.CircleDomainRigidity.chainDistanceline 46 - theorem
OAI.CircleDomainRigidity.chainDistance_leline 49 - theorem
OAI.CircleDomainRigidity.chainDistance_anchorline 53 - theorem
OAI.CircleDomainRigidity.le_chainDistanceline 57 - theorem
OAI.CircleDomainRigidity.chainDistance_extendline 61 - def
OAI.CircleDomainRigidity.chainPotentialline 69 - theorem
OAI.CircleDomainRigidity.chainPotential_le_oneline 71 - theorem
OAI.CircleDomainRigidity.chainPotential_anchorline 73 - theorem
OAI.CircleDomainRigidity.chainPotential_separatedline 76 - theorem
OAI.CircleDomainRigidity.min_one_add_leline 84 - theorem
OAI.CircleDomainRigidity.chainPotential_extendline 91 - theorem
OAI.CircleDomainRigidity.chainPotential_two_sidedline 97