introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.13 kB
import Mathlib
import OAI.Analysis.BiholderTransport.Coordinates.CompactConfigurations
import OAI.Analysis.BiholderTransport.Regularity.FiniteSimplexRepresentation
namespace OAI
noncomputable section
open Set Filter
open scoped Topology
namespace WeakMTWTransport
lemma fixed_simplex_representation {E : Type*} [AddCommGroup E] [Module ℝ E]
[FiniteDimensional ℝ E] {S : Set E} {x : E} (hx : x∈convexHull ℝ S) :
βˆƒ z : Fin (Module.finrank ℝ E+1) β†’ E, βˆƒ w : Fin (Module.finrank ℝ E+1) β†’ ℝ,
(βˆ€ i,z i∈S) ∧ (βˆ€ i,0≀w i) ∧ βˆ‘ i,w i=1 ∧ βˆ‘ i,w i β€’ z i=x := by
classical
obtain ⟨m,hm,hN,z,w,hz,hw,hs,hb⟩ := finite_simplex_representation hx
obtain ⟨r,he⟩ := Nat.exists_eq_add_of_le hN
rw [he]
refine ⟨Fin.addCases z (fun _ : Fin r => z ⟨0,hm⟩),
Fin.addCases w (fun _ : Fin r => 0),?_,?_,?_,?_⟩
Β· intro i
refine Fin.addCases (fun j=>?_) (fun j=>?_) i
Β· simpa only [Fin.addCases_left] using hz j
· simpa only [Fin.addCases_right] using hz ⟨0,hm⟩
Β· intro i
refine Fin.addCases (fun j=>?_) (fun j=>?_) i
Β· simpa only [Fin.addCases_left] using hw j
Β· simp only [Fin.addCases_right,le_refl]
Β· simpa only [Fin.sum_univ_add,Fin.addCases_left,Fin.addCases_right,Finset.sum_const_zero,
add_zero] using hs
Β· simpa only [Fin.sum_univ_add,Fin.addCases_left,Fin.addCases_right,zero_smul,
Finset.sum_const_zero,add_zero] using hb
lemma compact_barycentric_limit {E : Type*} [NormedAddCommGroup E]
[NormedSpace ℝ E] [FiniteDimensional ℝ E] {C : Set (EΓ—E)} (hC : IsCompact C)
{a v : β„• β†’ E} {aβ‚€ vβ‚€ : E} (ha : Tendsto a atTop (𝓝 aβ‚€))
(hv : Tendsto v atTop (𝓝 vβ‚€))
(hrep : βˆ€ k,v k∈convexHull ℝ {p | (a k,p)∈C}) :
βˆƒ z : β„• β†’ Fin (Module.finrank ℝ E+1) β†’ E,
βˆƒ w : β„• β†’ Fin (Module.finrank ℝ E+1) β†’ ℝ,
βˆƒ zβ‚€ : Fin (Module.finrank ℝ E+1) β†’ E,
βˆƒ wβ‚€ : Fin (Module.finrank ℝ E+1) β†’ ℝ,
βˆƒ Οƒ : β„• β†’ β„•, StrictMono Οƒ ∧
(βˆ€ k,(βˆ€ i,(a k,z k i)∈C) ∧ (βˆ€ i,0≀w k i) ∧
βˆ‘ i,w k i=1 ∧ βˆ‘ i,w k i β€’ z k i=v k) ∧
Tendsto (z ∘ Οƒ) atTop (𝓝 zβ‚€) ∧ Tendsto (w ∘ Οƒ) atTop (𝓝 wβ‚€) ∧
(βˆ€ i,(aβ‚€,zβ‚€ i)∈C) ∧ (βˆ€ i,0≀wβ‚€ i) ∧ βˆ‘ i,wβ‚€ i=1 ∧ βˆ‘ i,wβ‚€ i β€’ zβ‚€ i=vβ‚€ := by
classical
choose z w hz hw hs hb using (fun k=>fixed_simplex_representation (hrep k))
let d : β„• β†’ EnvelopeData E (Fin (Module.finrank ℝ E+1)) :=
fun k=>((a k,z k),(w k,0))
have hcompact := compact_common_base_configurations
(ΞΉ := Fin (Module.finrank ℝ E+1)) hC 0
have hd : βˆ€ k,d k∈{q : EnvelopeData E (Fin (Module.finrank ℝ E+1)) |
(βˆ€ i,(q.1.1,q.1.2 i)∈C) ∧ (βˆ€ i,0≀q.2.1 i) ∧ βˆ‘ i,q.2.1 i=1 ∧ q.2.2∈Icc 0 0} :=
fun k=>⟨hz k,hw k,hs k,le_refl _,le_refl _⟩
obtain ⟨q,hq,Οƒ,hΟƒ,hlim⟩ := hcompact.tendsto_subseq hd
have ha' : Tendsto (a ∘ Οƒ) atTop (𝓝 q.1.1) := hlim.fst_nhds.fst_nhds
have hae : q.1.1=a₀ := tendsto_nhds_unique ha' (ha.comp hσ.tendsto_atTop)
refine ⟨z,w,q.1.2,q.2.1,Οƒ,hΟƒ,(fun k=>⟨hz k,hw k,hs k,hb k⟩),
hlim.fst_nhds.snd_nhds,hlim.snd_nhds.fst_nhds,?_,hq.2.1,hq.2.2.1,?_⟩
Β· simpa only [hae] using hq.1
Β· have hsum : Tendsto (fun k=>βˆ‘ i,w (Οƒ k) i β€’ z (Οƒ k) i) atTop
(𝓝 (βˆ‘ i,q.2.1 i β€’ q.1.2 i)) := by
apply tendsto_finsetSum
intro i _
exact ((tendsto_pi_nhds.mp hlim.snd_nhds.fst_nhds) i).smul
((tendsto_pi_nhds.mp hlim.fst_nhds.snd_nhds) i)
simp only [hb] at hsum
exact tendsto_nhds_unique hsum (hv.comp hσ.tendsto_atTop)
lemma positive_barycentric_restriction {E : Type*} [AddCommGroup E] [Module ℝ E]
{ΞΉ : Type*} [Fintype ΞΉ] (p : ΞΉ β†’ E) (w : ΞΉ β†’ ℝ)
(hw : βˆ€ i,0≀w i) (hs : βˆ‘ i,w i=1) :
let ΞΊ := {i : ΞΉ // 0<w i}
Nonempty ΞΊ ∧ (βˆ‘ i:ΞΊ,w i=1) ∧
(βˆ‘ i:ΞΊ,w i β€’ p i=βˆ‘ i,w i β€’ p i) ∧
βˆ€ f : ΞΉ β†’ ℝ,βˆ‘ i:ΞΊ,w i*f i=βˆ‘ i,w i*f i := by
classical
dsimp only
have he (f : ΞΉ β†’ E) : (βˆ‘ i:{i : ΞΉ // 0<w i},w i β€’ f i)=βˆ‘ i,w i β€’ f i := by
rw [←Finset.sum_subtype (p := fun i=>0<w i) (Finset.univ.filter (fun i=>0<w i)) (by simp) (fun i=>w i β€’ f i)]
exact Finset.sum_subset (Finset.filter_subset _ _) (by
intro i hi hn
have hi0 : w i=0 := le_antisymm (not_lt.mp (by simpa using hn)) (hw i)
simp only [hi0,zero_smul])
have hr (f : ΞΉ β†’ ℝ) : (βˆ‘ i:{i : ΞΉ // 0<w i},w i*f i)=βˆ‘ i,w i*f i := by
rw [←Finset.sum_subtype (p := fun i=>0<w i) (Finset.univ.filter (fun i=>0<w i)) (by simp) (fun i=>w i*f i)]
exact Finset.sum_subset (Finset.filter_subset _ _) (by
intro i hi hn
have hi0 : w i=0 := le_antisymm (not_lt.mp (by simpa using hn)) (hw i)
simp only [hi0,zero_mul])
have hsum : (βˆ‘ i:{i : ΞΉ // 0<w i},w i)=1 := by
simpa only [mul_one] using (hr (fun _=>1)).trans (by simpa only [mul_one] using hs)
refine ⟨?_,hsum,he p,hr⟩
by_contra hn
have : IsEmpty {i : ΞΉ // 0<w i} := not_nonempty_iff.mp hn
simp at hsum
end WeakMTWTransport
end
end OAI