OAI/Combinatorics/GraphThreshold/ProbabilityTreeFacts.lean
13 declarations, 0 contain sorry, 0 declared as axioms
Path and locality facts for the stable finite probability-tree representation.
- theorem
OAI.LeanBlast.SecondKahnKalai.DependsOnlyOn.monoline 16 - theorem
OAI.LeanBlast.SecondKahnKalai.DependsOnlyOn.dependsOutsideline 28 - theorem
OAI.LeanBlast.SecondKahnKalai.DependsOutside.sdiff_eqline 40 - theorem
OAI.LeanBlast.SecondKahnKalai.dependsOutside_iff_sdiffline 46 - theorem
OAI.LeanBlast.SecondKahnKalai.DependsOutside.union_eqline 53 - theorem
OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.branch_nonemptyline 69Source documentation
A finite law of total mass one has a nonempty underlying type.
theorem branch_nonempty {B : Type} [Fintype B] (law : FiniteLaw B) : Nonempty B := by …Mentions: OAI.LeanBlast.SecondKahnKalai.FiniteLaw
- instance
OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.pathNonemptyline 77Source documentation
Every equal-depth probability tree has at least one full path.
instance pathNonempty {d : ℕ} (T : ProbabilityTree X d) : Nonempty T.Path := by … - def
OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.choosePathline 85Source documentation
A fixed deterministic full path, used only to resolve finite choices.
def choosePath {d : ℕ} (T : ProbabilityTree X d) : T.Path := Classical.choice (pathNonempty T)Mentions: OAI.LeanBlast.SecondKahnKalai.ProbabilityTree, OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.pathNonempty
- theorem
OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.pathLabels_lengthline 87 - theorem
OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.label_subset_supportline 99 - theorem
OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.child_support_subsetline 106 - theorem
OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.labels_support_subsetline 113 - theorem
OAI.LeanBlast.SecondKahnKalai.ProbabilityTree.child_dependsOutsideline 121