OAI/Combinatorics/EditApproximation/Refinement/ComputedQueryCorrect.lean
4 declarations, 0 contain sorry, 0 declared as axioms
- theorem
OAI.EditApproximation.computedQueryParameters_valuesline 10 - def
OAI.EditApproximation.computedQueryReferenceline 19 - theorem
OAI.EditApproximation.computedQueryMemoNormalized_correctline 33 - theorem
OAI.EditApproximation.computedQueryMemoNormalized_width_boundline 73Source documentation
Width of the actual stored word.
theorem computedQueryMemoNormalized_width_bound (source target : List ℕ) (N : ℕ) (occurrence : BinaryMemo PositionCounts) (symbolBits positionBits : ℕ) (input : ComputedFamilyInput source target N) (hf : 3 ≤ smallLogExponent N) (hs : ∀ z ∈ source, z < 2 ^ symbolBits) (ht : ∀ z ∈ target, z < 2 ^ symbolBits) (hp : target.length ≤ 2 ^ positionBits) (htable : occurrence = occurrenceBuild symbolBits positionBits target.zipIdx) (key : ComputedFamilyMemoKey source target N) (V : ℕ) (hV : |computedFamilyExpectedValue source target N input key| ≤ (V : ℚ)) : (rankedBitProgramValue (SourceRanked.rank ChargedPhysicalRequest.rank) (computedQueryMemoNormalized source target N occurrence symbolBits positionBits input) key).width ≤ Nat.size V + 2 * (queryFamilyMemoRemaining target N (integerParameters N).P (inputSmallLog N) (40 * smallLogExponent N) (inputHeight N) (inputSmallLog N ^ 80) key * …Mentions: OAI.EditApproximation.BinaryMemo, OAI.EditApproximation.PositionCounts, OAI.EditApproximation.ComputedFamilyInput, OAI.EditApproximation.smallLogExponent, OAI.EditApproximation.occurrenceBuild, OAI.EditApproximation.ComputedFamilyMemoKey, OAI.EditApproximation.computedFamilyExpectedValue, OAI.EditApproximation.rankedBitProgramValue, OAI.EditApproximation.SourceRanked.rank, OAI.EditApproximation.ChargedPhysicalRequest.rank, OAI.EditApproximation.computedQueryMemoNormalized, OAI.EditApproximation.queryFamilyMemoRemaining, OAI.EditApproximation.integerParameters, OAI.EditApproximation.inputSmallLog, OAI.EditApproximation.inputHeight