File size: 5,728 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 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 | import OAI.Geometry.ProjectionVolume.FiniteApproximation
import Mathlib.Analysis.SpecificLimits.Basic
import Mathlib.Analysis.Normed.Module.Ball.Pointwise
namespace OAI
open Set Metric Filter
open scoped Pointwise Topology
namespace Paper092
noncomputable def inscribedScale (m : β) : β := 1 - 1 / ((m : β) + 2)
theorem inscribedScale_nonneg (m : β) : 0 β€ inscribedScale m := by
unfold inscribedScale
apply sub_nonneg.mpr
apply (div_le_one (by positivity : 0 < (m : β) + 2)).mpr
linarith [Nat.cast_nonneg (Ξ± := β) m]
theorem inscribedScale_lt_one (m : β) : inscribedScale m < 1 := by
unfold inscribedScale
exact sub_lt_self _ (by positivity)
theorem exists_increasing_inscribed_finsets {n : β} {K : Set (Euclidean n)}
(hc : IsCompact K) (hv : Convex β K) (h0 : (0 : Euclidean n) β interior K) :
β V : β β Finset (Euclidean n),
Monotone (fun m => convexHull β (V m : Set (Euclidean n))) β§
(β m, convexHull β (V m : Set (Euclidean n)) β K) β§
(β m, inscribedScale m β’ K β interior (convexHull β (V m : Set (Euclidean n)))) β§
(β m, (0 : Euclidean n) β interior (convexHull β (V m : Set (Euclidean n)))) := by
classical
have hex := fun m => exists_inscribed_finset_sandwich hc hv h0
(inscribedScale_nonneg m) (inscribedScale_lt_one m)
choose t ht htK ht0 using hex
let V : β β Finset (Euclidean n) := fun m => (Finset.range (m + 1)).biUnion t
have htV (i m : β) (hi : i β€ m) : (t i : Set (Euclidean n)) β V m := by
intro x hx
exact Finset.mem_biUnion.mpr β¨i, Finset.mem_range.mpr (by omega), hxβ©
refine β¨V, ?_, ?_, ?_, ?_β©
Β· intro i j hij
apply convexHull_mono
intro x hx
obtain β¨k, hk, hxβ© := Finset.mem_biUnion.mp hx
exact Finset.mem_biUnion.mpr β¨k, Finset.mem_range.mpr
((Finset.mem_range.mp hk).trans_le (by omega)), hxβ©
Β· intro m
apply convexHull_min _ hv
intro x hx
obtain β¨i, _, hxβ© := Finset.mem_biUnion.mp hx
exact htK i (subset_convexHull β (t i : Set (Euclidean n)) hx)
Β· intro m
exact (ht m).trans (interior_mono (convexHull_mono (htV m m le_rfl)))
Β· intro m
exact interior_mono (convexHull_mono (htV m m le_rfl)) (ht0 m)
theorem add_closedBall_subset_dilate {n : β} {P : Set (Euclidean n)}
(hv : Convex β P) {a Ξ΅ : β} (ha : 0 < a) (he : 0 β€ Ξ΅)
(hball : closedBall (0 : Euclidean n) a β P) :
P + closedBall (0 : Euclidean n) Ξ΅ β (1 + Ξ΅ / a) β’ P := by
have heq : (Ξ΅ / a) β’ closedBall (0 : Euclidean n) a = closedBall 0 Ξ΅ := by
rw [smul_closedBall _ _ ha.le, smul_zero, Real.norm_eq_abs,
abs_of_nonneg (div_nonneg he ha.le), div_mul_cancelβ _ ha.ne']
rw [β heq, hv.add_smul zero_le_one (div_nonneg he ha.le), one_smul]
exact add_subset_add subset_rfl (image_mono hball)
theorem inscribed_thickening {n : β} {K P : Set (Euclidean n)} {R : β}
(hR : β x β K, βxβ β€ R) (m : β) (hP : inscribedScale m β’ K β P) :
K β P + closedBall (0 : Euclidean n) (R / ((m : β) + 2)) := by
intro x hx
refine β¨inscribedScale m β’ x, hP β¨x, hx, rflβ©,
(1 / ((m : β) + 2)) β’ x, ?_, ?_β©
Β· simp only [mem_closedBall, dist_zero_right, norm_smul, Real.norm_eq_abs,
abs_of_nonneg (by positivity : 0 β€ 1 / ((m : β) + 2))]
calc
1 / ((m : β) + 2) * βxβ β€ 1 / ((m : β) + 2) * R :=
mul_le_mul_of_nonneg_left (hR x hx) (by positivity)
_ = R / ((m : β) + 2) := by ring
Β· change inscribedScale m β’ x + (1 / ((m : β) + 2)) β’ x = x
rw [β add_smul]
simp [inscribedScale]
theorem tendsto_approximation_error (R : β) :
Tendsto (fun m : β => R / ((m : β) + 2)) atTop (π 0) := by
simpa only [Function.comp_def, Nat.cast_add, Nat.cast_ofNat] using
(tendsto_const_div_atTop_nhds_zero_nat R).comp (tendsto_add_atTop_nat 2)
theorem exists_inscribed_polytope_sequence {n : β} {K : Set (Euclidean n)}
(hc : IsCompact K) (hv : Convex β K) (h0 : (0 : Euclidean n) β interior K) :
β (V : β β Finset (Euclidean n)) (a R : β),
0 < a β§ 0 < R β§ K β closedBall 0 R β§
Monotone (fun m => convexHull β (V m : Set (Euclidean n))) β§
(β m, closedBall (0 : Euclidean n) a β convexHull β (V m : Set (Euclidean n))) β§
(β m, convexHull β (V m : Set (Euclidean n)) β K β§
K β convexHull β (V m : Set (Euclidean n)) + closedBall 0 (R / ((m : β) + 2)) β§
convexHull β (V m : Set (Euclidean n)) + closedBall 0 (R / ((m : β) + 2)) β
(1 + (R / ((m : β) + 2)) / a) β’ convexHull β (V m : Set (Euclidean n))) β§
Tendsto (fun m : β => R / ((m : β) + 2)) atTop (π 0) := by
obtain β¨V, hmono, hVK, hscale, hzeroβ© := exists_increasing_inscribed_finsets hc hv h0
obtain β¨r, hr, hballβ© := Metric.mem_nhds_iff.mp (mem_interior_iff_mem_nhds.mp (hzero 0))
obtain β¨R, hRpos, hRβ© := hc.isBounded.exists_pos_norm_le
have hball0 : closedBall (0 : Euclidean n) (r / 2) β convexHull β (V 0 : Set (Euclidean n)) :=
(closedBall_subset_ball (by linarith)).trans hball
have hballm : β m, closedBall (0 : Euclidean n) (r / 2) β
convexHull β (V m : Set (Euclidean n)) :=
fun m => hball0.trans (hmono (Nat.zero_le m))
refine β¨V, r / 2, R, half_pos hr, hRpos, ?_, hmono, hballm, ?_,
tendsto_approximation_error Rβ©
Β· intro x hx
simpa only [mem_closedBall, dist_zero_right] using hR x hx
Β· intro m
exact β¨hVK m, inscribed_thickening hR m ((hscale m).trans interior_subset),
add_closedBall_subset_dilate (convex_convexHull β _) (half_pos hr) (by positivity) (hballm m)β©
end Paper092
end OAI
|