math / data /lean /OAI /Geometry /CylinderCovering /Singular /EdgeOneCoverDefinitions.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.02 kB
import OAI.Geometry.CylinderCovering.Singular.BasicDefinitions
import OAI.Geometry.CylinderCovering.Singular.EdgeOneDefinitions
namespace OAI
noncomputable section
open Set MeasureTheory Filter Topology
namespace CylinderCovering.SingularEdgeOneCover
open RuledApproximation
def map (z : Space) : Space := vec3 (z 1 / 2) (z 0 / 2) (z 2 / 2)
def height : ℝ := 1 / Real.sqrt 2
def tetrahedron : Set Space :=
{z | βˆƒ s : ℝ, 0 ≀ s ∧ s ≀ 1 ∧ |z 0| ≀ s / 2 ∧
|z 1| ≀ (1 - s) / 2 ∧ z 2 = height * s}
def labelDomain (p k d q : ℝ) : Set Plane :=
{b | d ≀ b 1 ∧ b 1 ≀ 1 ∧ |b 0| ≀ b 1 / 2 ∧
b 1 ≀ (1 / 2 : ℝ) + k ^ 2 * SingularEdgeOne.edgeCeiling p (b 0) + q}
def lowerFamily (p k d q : ℝ) : Set Space :=
{z | βˆƒ b ∈ labelDomain p k d q, βˆƒ y : ℝ, |y| ≀ 1 / 2 ∧
z = vec3 (b 0 + k * y * SingularEdgeOne.edgeU p (b 0) (b 1)) y
(height * (b 1 + k * y * SingularEdgeOne.edgeV p (b 0) (b 1)))}
def upperFamily (p k d q : ℝ) : Set Space :=
{z | βˆƒ b ∈ labelDomain p k d q, βˆƒ x : ℝ, |x| ≀ 1 / 2 ∧
z = vec3 x (b 0 - k * x * SingularEdgeOne.edgeU p (b 0) (b 1))
(height * (1 - (b 1 - k * x * SingularEdgeOne.edgeV p (b 0) (b 1))))}
def lowerTip (d : ℝ) : Set Space :=
{z | βˆƒ s : ℝ, 0 ≀ s ∧ s ≀ 2 * d ∧ |z 0| ≀ s / 2 ∧ z 2 = height * s}
def upperTip (d : ℝ) : Set Space :=
{z | βˆƒ s : ℝ, 0 ≀ s ∧ s ≀ 2 * d ∧ |z 1| ≀ s / 2 ∧ z 2 = height * (1 - s)}
def cost (p k d q : ℝ) : ℝ :=
height * ∫ b in labelDomain p k d q,
physicalWeight height
(k β€’ vec2 (SingularEdgeOne.edgeU p (b 0) (b 1))
(SingularEdgeOne.edgeV p (b 0) (b 1)))
def FiniteCoverAt (p k d q : ℝ) : Prop :=
βˆƒ n m : β„•, βˆƒ C : Fin n β†’ Cylinder, βˆƒ D : Fin m β†’ Cylinder,
βˆƒ B₁ Bβ‚‚ : Cylinder,
(βˆ€ i, (C i).parallelogram) ∧ (βˆ€ j, (D j).parallelogram) ∧
B₁.triangle ∧ Bβ‚‚.triangle ∧
lowerFamily p k d q βŠ† familySet C ∧ upperFamily p k d q βŠ† familySet D ∧
B₁.carrier = lowerTip d ∧ Bβ‚‚.carrier = upperTip d ∧
B₁.area = 2 * height * d ^ 2 ∧ Bβ‚‚.area = 2 * height * d ^ 2 ∧
tetrahedron βŠ† familySet C βˆͺ familySet D βˆͺ B₁.carrier βˆͺ Bβ‚‚.carrier ∧
familyArea C + familyArea D + B₁.area + Bβ‚‚.area < height / 4
def AlternativeStatement : Prop :=
βˆ€ p Ξ² : ℝ, 1 < p β†’ p < (Real.sqrt 51 - 5) / 2 β†’
1 < Ξ² β†’ Ξ² < 1 / (2 - p) β†’
βˆ€αΆ  k : ℝ in 𝓝[>] 0, FiniteCoverAt p k (k ^ Ξ²) (k ^ (5 / 2 : ℝ))
def FlexibleStatement : Prop :=
βˆ€ (p : ℝ) (ρ q : ℝ β†’ ℝ), 1 < p β†’ p < (Real.sqrt 51-5)/2 β†’
SingularCutoff.Admissible p ρ q β†’
βˆ€αΆ  k : ℝ in 𝓝[>] 0, FiniteCoverAt p k (ρ (k/4)) (q (k/4))
def ExactStatement : Prop :=
βˆ€ p Ξ³ : ℝ, 1 < p β†’ p < (Real.sqrt 51-5)/2 β†’
1 < Ξ³ β†’ Ξ³ < 1/(2-p) β†’
βˆ€αΆ  k : ℝ in 𝓝[>] 0,
FiniteCoverAt p k ((4:ℝ)^(-Ξ³)*k^Ξ³) (k^(5/2:ℝ)/32)
def CostAt (p k d q : ℝ) : Prop :=
2*cost p k d q+4*height*d^2 < height/4 ∧
βˆ€ e : ℝ, 0 < e β†’
HasFiniteCover Cylinder.parallelogram (lowerFamily p k d q) (cost p k d q+e) ∧
HasFiniteCover Cylinder.parallelogram (upperFamily p k d q) (cost p k d q+e)
def CostStatement : Prop :=
βˆ€ (p : ℝ) (ρ q : ℝ β†’ ℝ), 1 < p β†’ p < (Real.sqrt 51-5)/2 β†’
SingularCutoff.Admissible p ρ q β†’
Asymptotics.IsLittleO (𝓝[>] (0:ℝ))
(fun k => cost p k (ρ (k/4)) (q (k/4))/height-
(1/8+singularCoefficient p/32*k^2)) (fun k => k^2) ∧
βˆ€αΆ  k : ℝ in 𝓝[>] 0, CostAt p k (ρ (k/4)) (q (k/4))
def AlternativeCostStatement : Prop :=
βˆ€ p Ξ² : ℝ, 1 < p β†’ p < (Real.sqrt 51-5)/2 β†’
1 < Ξ² β†’ Ξ² < 1/(2-p) β†’
Asymptotics.IsLittleO (𝓝[>] (0:ℝ))
(fun k => cost p k (k^Ξ²) (k^(5/2:ℝ))/height-
(1/8+singularCoefficient p/32*k^2)) (fun k => k^2) ∧
βˆ€αΆ  k : ℝ in 𝓝[>] 0, CostAt p k (k^Ξ²) (k^(5/2:ℝ))
end CylinderCovering.SingularEdgeOneCover
end
end OAI