File size: 3,526 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 | import OAI.MeasureTheory.Falconer.Shells.HighShellLeibnizSymbols
namespace OAI
namespace PlanarFalconer
theorem pair_assignment_endpoint_budget (S : Finset PolicyDescriptor) (k : PairMaskIndex β β)
(K : β) (hk : β a β pairMaskIndices S, k a β€ K) (l : Fin 2) :
β b β S, k (b,l) β€ K := by
apply le_trans _ hk
change (β b β S, k (b,l)) β€ β a β S.product (Finset.univ : Finset (Fin 2)), k a
rw [Finset.product_eq_sprod,Finset.sum_product S (Finset.univ : Finset (Fin 2)) k]
apply Finset.sum_le_sum
intro b hb
exact Finset.single_le_sum (f := fun y : Fin 2 => k (b,y)) (fun _ _ => Nat.zero_le _) (Finset.mem_univ l)
theorem minimal_assignment_scale (A : β β β) {N q a t j : β} {sig v : β}
(hsig : 0 β€ sig) (hq : 0 < q) (hqscale : sig*N β€ (q:β))
(hw : a+100*q < t) (hv : (t:β)-sig*N β€ v)
{b : β Γ (PairMaskIndex β β)}
(hb : b β inverseLeibnizTerms j (pairMaskIndices (policyDescriptorList A N q a t))) :
assignmentScale (policyDescriptorList A N q a t) N sig b.2 β€
(2:β)^((j:β)*(v-a)) := by
apply high_shell_extracted_scale _ Prod.fst b.2 hsig N a t j
Β· intro c hc
exact policyDescriptor_real_length A hq (Finset.mem_product.mp hc).1
Β· have hg := high_shell_gap hqscale hw hv
have hn : 0 β€ sig*(N:β) := mul_nonneg hsig (Nat.cast_nonneg _)
linarith
Β· exact hv
Β· exact inverseLeibnizTerms_budget j _ hb
theorem minimal_assignment_scale_absorbed (A : β β β) {N q a t j : β} {sig v : β}
(hsig : 0 β€ sig) (hq : 0 < q) (hqscale : sig*N β€ (q:β))
(hw : a+100*q < t) (hv : (t:β)-sig*N β€ v)
{b : β Γ (PairMaskIndex β β)}
(hb : b β inverseLeibnizTerms j (pairMaskIndices (policyDescriptorList A N q a t))) :
0 β€ (2:β)^(-(j:β)*(v-a))*assignmentScale (policyDescriptorList A N q a t) N sig b.2 β§
(2:β)^(-(j:β)*(v-a))*assignmentScale (policyDescriptorList A N q a t) N sig b.2 β€ 1 := by
have hpos : 0 β€ assignmentScale (policyDescriptorList A N q a t) N sig b.2 :=
Finset.prod_nonneg (fun c _ => pow_nonneg (inv_nonneg.mpr (sourceAngularRadius_pos _ _ _).le) _)
refine β¨mul_nonneg (by positivity) hpos,?_β©
apply (mul_le_mul_of_nonneg_left (minimal_assignment_scale A hsig hq hqscale hw hv hb)
(by positivity : 0 β€ (2:β)^(-(j:β)*(v-a)))).trans_eq
rw [β Real.rpow_add (by norm_num : (0:β) < 2)]
convert Real.rpow_zero 2 using 2
ring
theorem minimal_inverseLeibniz_cost (A : β β β) {N q a t : β} (hq : 0 < q) (j : β) :
((inverseLeibnizTerms j (pairMaskIndices (policyDescriptorList A N q a t))).map
(fun b => βb.1β)).sum β€
(inverseStationaryExpr j).cost * (2*((N:β)+1)^3)^(2*j) := by
apply (inverseLeibnizTerms_cost j _).trans
apply mul_le_mul_of_nonneg_left _ (inverseStationaryExpr j).cost_nonneg
apply pow_le_pow_leftβ (by positivity)
apply max_le
Β· have hn : 0 β€ (N:β) := Nat.cast_nonneg N
nlinarith [one_le_powβ (by linarith : (1:β) β€ (N:β)+1) (n := 3)]
Β· have hc : ((policyDescriptorList A N q a t).card:β) β€ ((N:β)+1)^3 := by
exact_mod_cast policyDescriptorList_card A hq
change ((Finset.product (policyDescriptorList A N q a t) (Finset.univ : Finset (Fin 2))).card:β) β€ _
rw [Finset.product_eq_sprod,Finset.card_product (policyDescriptorList A N q a t) (Finset.univ : Finset (Fin 2))]
simp only [Finset.card_univ,Fintype.card_fin,Nat.cast_mul,Nat.cast_ofNat]
linarith
end PlanarFalconer
end OAI
|