math / data /lean /OAI /Geometry /CylinderCovering /Ruled /NullDomain.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.64 kB
import OAI.Geometry.CylinderCovering.Nilpotent.C1
namespace OAI
noncomputable section
open Set MeasureTheory
namespace RuledApproximation
theorem empty_physical_pair (G : Plane β†’ Plane) (h a L : ℝ) :
βˆƒ C₁ Cβ‚‚ : Fin 0 β†’ Cylinder,
(βˆ€ i, (C₁ i).parallelogram ∧ (Cβ‚‚ i).parallelogram) ∧
physicalRuled h βˆ… G L βŠ† familySet C₁ ∧
secondPhysicalMap h a '' physicalRuled 1 βˆ… G L βŠ† familySet Cβ‚‚ ∧
familyArea C₁ = 0 ∧ familyArea Cβ‚‚ = 0 := by
refine ⟨Fin.elim0, Fin.elim0, fun i => i.elim0, ?_, ?_, ?_, ?_⟩
Β· simp [physicalRuled_empty]
Β· simp [physicalRuled_empty]
Β· simp [familyArea]
Β· simp [familyArea]
theorem null_domain_physical_pair {D : Set Plane} {G : Plane β†’ Plane}
(hD : IsCompact D) (hnull : volume D = 0) (hG : SmoothNear 1 D G)
(hnil : βˆ€ b ∈ D, (fderiv ℝ G b).comp (fderiv ℝ G b) = 0)
{h Ξ΅ : ℝ} (hh : 0 < h) (hΞ΅ : 0 < Ξ΅) (a : ℝ) :
βˆƒ n : β„•, βˆƒ C₁ Cβ‚‚ : Fin n β†’ Cylinder,
(βˆ€ i, (C₁ i).parallelogram ∧ (Cβ‚‚ i).parallelogram ∧
IsCompact (C₁ i).base ∧ IsCompact (Cβ‚‚ i).base ∧
Convex ℝ (C₁ i).base ∧ Convex ℝ (Cβ‚‚ i).base) ∧
physicalRuled h D G 1 βŠ† familySet C₁ ∧
secondPhysicalMap h a '' physicalRuled 1 D G 1 βŠ† familySet Cβ‚‚ ∧
familyArea C₁ = familyArea Cβ‚‚ ∧ familyArea C₁ + familyArea Cβ‚‚ < Ξ΅ := by
obtain ⟨n, T, g, _hT, hcover, hcost, hphysical⟩ :=
nilpotentC1 D G hD hG hnil h (Ξ΅ / (4 * h)) hh (by positivity)
rw [setIntegral_measure_zero _ hnull, zero_add] at hcost
obtain ⟨C₁, Cβ‚‚, hC⟩ := hphysical a
have harea₁ : familyArea C₁ = h * βˆ‘ i, volume.real (T i) * physicalWeight h (g i) := by
unfold familyArea
simp_rw [(hC _).2.2.2.2.1, mul_assoc]
rw [Finset.mul_sum]
have hareaβ‚‚ : familyArea Cβ‚‚ = h * βˆ‘ i, volume.real (T i) * physicalWeight h (g i) := by
unfold familyArea
simp_rw [(hC _).2.2.2.2.2, mul_assoc]
rw [Finset.mul_sum]
refine ⟨n, C₁, Cβ‚‚, ?_, ?_, ?_, harea₁.trans hareaβ‚‚.symm, ?_⟩
Β· intro i
obtain ⟨hpar₁, hparβ‚‚, _⟩ := hC i
exact ⟨hpar₁, hparβ‚‚, hpar₁.isCompact, hparβ‚‚.isCompact,
hpar₁.convex, hparβ‚‚.convex⟩
Β· rw [← firstPhysicalMap_ruled]
rintro _ ⟨z, hz, rfl⟩
obtain ⟨i, hi⟩ := mem_iUnion.mp (hcover hz)
exact mem_iUnion.mpr ⟨i, (hC i).2.2.1 β–Έ mem_image_of_mem _ hi⟩
· rintro _ ⟨z, hz, rfl⟩
obtain ⟨i, hi⟩ := mem_iUnion.mp (hcover hz)
exact mem_iUnion.mpr ⟨i, (hC i).2.2.2.1 β–Έ mem_image_of_mem _ hi⟩
Β· rw [harea₁, hareaβ‚‚]
have hc := mul_le_mul_of_nonneg_left hcost hh.le
have he : h * (Ξ΅ / (4 * h)) = Ξ΅ / 4 := by field_simp
rw [he] at hc
linarith
theorem null_domain_physical_pair_of_fderiv_zero
{D : Set Plane} {G : Plane β†’ Plane}
(hD : IsCompact D) (hnull : volume D = 0) (hG : SmoothNear 1 D G)
(hzero : βˆ€ b ∈ D, fderiv ℝ G b = 0)
{h Ξ΅ : ℝ} (hh : 0 < h) (hΞ΅ : 0 < Ξ΅) (a : ℝ) :
βˆƒ n : β„•, βˆƒ C₁ Cβ‚‚ : Fin n β†’ Cylinder,
(βˆ€ i, (C₁ i).parallelogram ∧ (Cβ‚‚ i).parallelogram ∧
IsCompact (C₁ i).base ∧ IsCompact (Cβ‚‚ i).base ∧
Convex ℝ (C₁ i).base ∧ Convex ℝ (Cβ‚‚ i).base) ∧
physicalRuled h D G 1 βŠ† familySet C₁ ∧
secondPhysicalMap h a '' physicalRuled 1 D G 1 βŠ† familySet Cβ‚‚ ∧
familyArea C₁ = familyArea Cβ‚‚ ∧ familyArea C₁ + familyArea Cβ‚‚ < Ξ΅ := by
apply null_domain_physical_pair hD hnull hG _ hh hΞ΅ a
intro b hb
simp [hzero b hb]
end RuledApproximation
end
end OAI