Download data/lean/OAI/Combinatorics/EditApproximation/Geometry/ChargedSeedQuery.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.2 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/EditApproximation/Geometry/ChargedSeedQuery.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/EditApproximation/Geometry/ChargedSeedQuery.lean
-
curl -L -o ChargedSeedQuery.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/EditApproximation/Geometry/ChargedSeedQuery.lean
2.2 kB
| import OAI.Combinatorics.EditApproximation.Geometry.ChargedPhysicalRequest | |
| import OAI.Combinatorics.EditApproximation.Refinement.PhysicalMedianQuery | |
| import OAI.Combinatorics.EditApproximation.Definitions | |
| namespace OAI | |
| /-! A pass-zero seed read requests a cached coarse entry. Later seed reads | |
| request the previous pass's final table value in each distinct copy. | |
| Thus neither kind of seed value enters the charged program as a free oracle. -/ | |
| namespace EditApproximation | |
| theorem chargedSeedQuery_value {M J ny passes copies T S : β} (N : β) (multiplier : β β β) | |
| (parent : {r : PhysicalTableRequest M J ny // r.Bounded passes copies T S}) | |
| (q : TargetInterval ny) (answer : ChargedPhysicalRequest M J ny passes copies T S β β) : | |
| (chargedSeedQuery N multiplier parent (parent.val.node, q)).value (fun child => answer child.val) = | |
| if parent.val.pass = 0 then answer (Sum.inl (parent.val.node, q)) else | |
| (min N (upperMedian (List.ofFn fun copy : Fin copies => | |
| β(multiplier (parent.val.pass - 1) : β) * | |
| answer (Sum.inr (chargedPreviousPass parent q copy))ββ)) : β) := by | |
| unfold chargedSeedQuery | |
| rw [dite_eq_left rfl] | |
| split_ifs with hp | |
| Β· rfl | |
| Β· rw [FiniteQuery.collect_value] | |
| simp only [chargedPreviousRead, FiniteQuery.value, List.map_map, | |
| List.ofFn_eq_map, Function.comp_def] | |
| theorem chargedSeedQuery_cost {M J ny passes copies T S : β} (N : β) (multiplier : β β β) | |
| (parent : {r : PhysicalTableRequest M J ny // r.Bounded passes copies T S}) | |
| (state : PhysicalEntry M J ny) | |
| (oracle : {child : ChargedPhysicalRequest M J ny passes copies T S // | |
| child.rank < ChargedPhysicalRequest.rank (Sum.inr parent)} β β) : | |
| (chargedSeedQuery N multiplier parent state).cost oracle (fun _ => 1) = | |
| if state.1 = parent.val.node then if parent.val.pass = 0 then 1 else copies else 0 := by | |
| unfold chargedSeedQuery | |
| split_ifs with hnode hpass | |
| Β· rfl | |
| Β· rw [FiniteQuery.cost_collect] | |
| simp only [chargedPreviousRead, FiniteQuery.cost, Nat.add_zero, List.map_const', | |
| List.length_finRange, List.sum_replicate, smul_eq_mul, Nat.mul_one] | |
| Β· rfl | |
| end EditApproximation | |
| end OAI | |