OAI/Analysis/LipschitzHilbert/Trees/SourceFiniteSizeBound.lean
2 declarations, 0 contain sorry, 0 declared as axioms
Every finite packet collection has a finite initial unsigned size. This starts the threshold algorithm without an additional size premise.
- theorem
OAI.LipschitzHilbert.SourceLabeledLattice.unsignedSizeTestEnergy_le_coefficient_sumline 14 - theorem
OAI.LipschitzHilbert.SourceLabeledLattice.exists_finite_unsigned_size_boundline 31