Download data/lean/OAI/Geometry/ProjectionVolume/ExposedProduct.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.55 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/ProjectionVolume/ExposedProduct.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Geometry/ProjectionVolume/ExposedProduct.lean
-
curl -L -o ExposedProduct.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/ProjectionVolume/ExposedProduct.lean
4.55 kB
| import OAI.Geometry.ProjectionVolume.ProductPolytope | |
| import Mathlib.Analysis.Convex.Exposed | |
| import Mathlib.LinearAlgebra.AffineSpace.FiniteDimensional | |
| namespace OAI | |
| noncomputable section | |
| open Set MeasureTheory | |
| open scoped RealInnerProductSpace | |
| namespace Paper092 | |
| def exposedFace {n : β} (K : Set (Euclidean n)) (u : Euclidean n) : Set (Euclidean n) := | |
| (innerSL β u).toExposed K | |
| @[simp] theorem exposedFace_zero {n : β} (K : Set (Euclidean n)) : exposedFace K 0 = K := by | |
| ext x | |
| simp [exposedFace, ContinuousLinearMap.toExposed] | |
| theorem exposedFace_nonempty {n : β} (K : Set (Euclidean n)) (hK : IsCompact K) | |
| (hne : K.Nonempty) (u : Euclidean n) : (exposedFace K u).Nonempty := by | |
| obtain β¨x, hx, hmaxβ© := hK.exists_isMaxOn hne (innerSL β u).continuous.continuousOn | |
| exact β¨x, hx, hmaxβ© | |
| theorem exposedFace_product {r s : β} (A : Set (Euclidean r)) (B : Set (Euclidean s)) | |
| (w : Euclidean (r + s)) : | |
| exposedFace (cartesianBody A B) w = | |
| cartesianBody (exposedFace A (splitEuclideanProduct r s w).1) | |
| (exposedFace B (splitEuclideanProduct r s w).2) := by | |
| ext x | |
| change (x β cartesianBody A B β§ β y β cartesianBody A B, βͺw, yβ« β€ βͺw, xβ«) β | |
| (((splitEuclideanProduct r s x).1 β A β§ | |
| β a β A, βͺ(splitEuclideanProduct r s w).1, aβ« β€ | |
| βͺ(splitEuclideanProduct r s w).1, (splitEuclideanProduct r s x).1β«) β§ | |
| ((splitEuclideanProduct r s x).2 β B β§ | |
| β b β B, βͺ(splitEuclideanProduct r s w).2, bβ« β€ | |
| βͺ(splitEuclideanProduct r s w).2, (splitEuclideanProduct r s x).2β«)) | |
| constructor | |
| Β· rintro β¨β¨hA, hBβ©, hmaxβ© | |
| refine β¨β¨hA, ?_β©, β¨hB, ?_β©β© | |
| Β· intro a ha | |
| have hm : (splitEuclideanProduct r s).symm (a, (splitEuclideanProduct r s x).2) β | |
| cartesianBody A B := by | |
| rw [cartesianBody_eq_preimage, Set.mem_preimage, | |
| ContinuousLinearEquiv.apply_symm_apply] | |
| exact β¨ha, hBβ© | |
| have h := hmax _ hm | |
| rw [splitEuclideanProduct_inner r s, splitEuclideanProduct_inner r s, | |
| ContinuousLinearEquiv.apply_symm_apply] at h | |
| exact (add_le_add_iff_right _).mp h | |
| Β· intro b hb | |
| have hm : (splitEuclideanProduct r s).symm ((splitEuclideanProduct r s x).1, b) β | |
| cartesianBody A B := by | |
| rw [cartesianBody_eq_preimage, Set.mem_preimage, | |
| ContinuousLinearEquiv.apply_symm_apply] | |
| exact β¨hA, hbβ© | |
| have h := hmax _ hm | |
| rw [splitEuclideanProduct_inner r s, splitEuclideanProduct_inner r s, | |
| ContinuousLinearEquiv.apply_symm_apply] at h | |
| exact (add_le_add_iff_left _).mp h | |
| Β· rintro β¨β¨hA, hmaxAβ©, β¨hB, hmaxBβ©β© | |
| refine β¨β¨hA, hBβ©, ?_β© | |
| intro y hy | |
| rw [splitEuclideanProduct_inner r s, splitEuclideanProduct_inner r s] | |
| exact add_le_add (hmaxA _ hy.1) (hmaxB _ hy.2) | |
| theorem cartesianBody_eq_image {r s : β} (A : Set (Euclidean r)) (B : Set (Euclidean s)) : | |
| cartesianBody A B = (splitEuclideanProduct r s).symm '' (A ΓΛ’ B) := by | |
| ext x | |
| constructor | |
| Β· intro hx | |
| exact β¨splitEuclideanProduct r s x, hx, (splitEuclideanProduct r s).symm_apply_apply xβ© | |
| Β· rintro β¨y, hy, rflβ© | |
| change splitEuclideanProduct r s ((splitEuclideanProduct r s).symm y) β A ΓΛ’ B | |
| simpa using hy | |
| theorem submodule_prod_finrank {r s : β} (P : Submodule β (Euclidean r)) | |
| (Q : Submodule β (Euclidean s)) : | |
| Module.finrank β (P.prod Q) = Module.finrank β P + Module.finrank β Q := by | |
| let e : (P.prod Q) ββ[β] P Γ Q := | |
| { toFun := fun x => (β¨x.1.1, x.2.1β©, β¨x.1.2, x.2.2β©) | |
| invFun := fun x => β¨(x.1, x.2), β¨x.1.2, x.2.2β©β© | |
| left_inv := fun _ => rfl | |
| right_inv := fun _ => rfl | |
| map_add' := fun _ _ => rfl | |
| map_smul' := fun _ _ => rfl } | |
| rw [e.finrank_eq, Module.finrank_prod] | |
| theorem cartesianBody_affine_dimension {r s : β} (A : Set (Euclidean r)) (B : Set (Euclidean s)) | |
| (hA : A.Nonempty) (hB : B.Nonempty) : | |
| Module.finrank β (vectorSpan β (cartesianBody A B)) = | |
| Module.finrank β (vectorSpan β A) + Module.finrank β (vectorSpan β B) := by | |
| let e := (splitEuclideanProduct r s).symm.toLinearEquiv | |
| rw [cartesianBody_eq_image] | |
| change Module.finrank β (vectorSpan β (e.toLinearMap.toAffineMap '' (A ΓΛ’ B))) = _ | |
| rw [β AffineMap.map_vectorSpan] | |
| change Module.finrank β ((vectorSpan β (A ΓΛ’ B)).map e.toLinearMap) = _ | |
| rw [e.finrank_map_eq, vectorSpan_prod_eq hA hB, submodule_prod_finrank] | |
| end Paper092 | |
| end | |
| end OAI | |