OAI/Probability/SpanningForest/BorelExhaustion.lean

GitHub source file

21 declarations, 0 contain sorry, 0 declared as axioms

  1. def OAI.Problem336.BorelExhaustion.edgeWindow line 12
  2. lemma OAI.Problem336.BorelExhaustion.mem_edgeWindow line 17
  3. lemma OAI.Problem336.BorelExhaustion.measurable_edgeWindow line 22
  4. def OAI.Problem336.BorelExhaustion.extensionChoice line 29
  5. lemma OAI.Problem336.BorelExhaustion.measurable_extensionChoice line 32
  6. lemma OAI.Problem336.BorelExhaustion.extensionChoice_spec line 35
  7. def OAI.Problem336.BorelExhaustion.requirements line 41
  8. lemma OAI.Problem336.BorelExhaustion.measurable_requirements line 44
  9. def OAI.Problem336.BorelExhaustion.candidate line 54
  10. lemma OAI.Problem336.BorelExhaustion.measurable_candidate line 58
  11. lemma OAI.Problem336.BorelExhaustion.measurable_candidate_sequence line 67
  12. def OAI.Problem336.BorelExhaustion.ExtensionProperty line 70
  13. lemma OAI.Problem336.BorelExhaustion.step_spec line 75
  14. lemma OAI.Problem336.BorelExhaustion.candidate_spec line 88
  15. lemma OAI.Problem336.BorelExhaustion.candidate_isConnectedExhaustion line 103
  16. lemma OAI.Problem336.BorelExhaustion.extensionProperty_of_graphConnected line 114
  17. theorem OAI.Problem336.BorelExhaustion.candidate_isConnectedExhaustion_of_connected line 118
  18. theorem OAI.Problem336.BorelExhaustion.exists_measurable_connected_exhaustion line 122
  19. lemma OAI.Problem336.BorelExhaustion.subgraphAdj_implies_adj line 128
  20. lemma OAI.Problem336.BorelExhaustion.graphConnected_iff_finiteConnected_pairs line 141
  21. lemma OAI.Problem336.BorelExhaustion.measurableSet_graphConnected line 153