OAI/Combinatorics/EditApproximation/Coarse/CoarseInitialLabels.lean
3 declarations, 0 contain sorry, 0 declared as axioms
- theorem
OAI.EditApproximation.coarseInitialLabelCount_le_arrayWorkline 13Source documentation
Only labels in roots actually reached by the dyadic initializer are drawn.
theorem coarseInitialLabelCount_le_arrayWork {α : Type*} [DecidableEq α] (B d : ℕ) (Q lam : ℚ) (x y : List α) (draws : CoarseGuessIndex (coarseEntryWidth x y) → CoarseThresholdDraws B d) : coarseInitialLabelCount B d Q lam x y draws ≤ coarseInitialArrayWork B d Q lam x y draws := by …Mentions: OAI.EditApproximation.CoarseGuessIndex, OAI.EditApproximation.coarseEntryWidth, OAI.EditApproximation.CoarseThresholdDraws, OAI.EditApproximation.coarseInitialLabelCount, OAI.EditApproximation.coarseInitialArrayWork
- def
OAI.EditApproximation.coarseInitialSamplingBitsline 24 - theorem
OAI.EditApproximation.coarseInitialSamplingBits_leline 29