OAI/Analysis/LipschitzHilbert/Packets/PacketDataDeletionForest.lean
10 declarations, 0 contain sorry, 0 declared as axioms
The full trees removed by the size-selection loop, including the nonseparated packets deleted with each recorded top.
- def
OAI.LipschitzHilbert.PacketLatticeData.sizeDeletionRecordsline 16 - theorem
OAI.LipschitzHilbert.PacketLatticeData.sizeDeletionRecords_topsline 22 - theorem
OAI.LipschitzHilbert.PacketLatticeData.sizeDeletionRecords_subsetline 29 - theorem
OAI.LipschitzHilbert.PacketLatticeData.sizeDeletionRecords_disjointline 40 - theorem
OAI.LipschitzHilbert.PacketLatticeData.SizeStoppingRun.deletion_forest_coversline 61 - theorem
OAI.LipschitzHilbert.PacketLatticeData.SizeStoppingRun.deletion_forest_nonemptyline 74 - theorem
OAI.LipschitzHilbert.PacketLatticeData.SizeStoppingRun.deletion_forest_geometryline 87 - theorem
OAI.LipschitzHilbert.PacketLatticeData.SizeStoppingRun.deletion_forest_sumline 104 - theorem
OAI.LipschitzHilbert.PacketLatticeData.SizeStoppingRun.deletion_forest_arealine 121 - theorem
OAI.LipschitzHilbert.PacketLatticeData.two_size_deletion_forest_sumline 131