math / data /lean /OAI /Geometry /CylinderCovering /Beams /FullDefinitions.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.43 kB
import OAI.Geometry.CylinderCovering.Beams.MainDefinitions
namespace OAI
noncomputable section
open Set MeasureTheory
open scoped InnerProductSpace
namespace ShortenedBeam
def vertices : Fin 4 β†’ Space :=
![point 2 0 (-1), point (-2) 0 (-1), point 0 2 1, point 0 (-2) 1]
def GeometryStatement : Prop :=
tetrahedron = convexHull ℝ (range vertices) ∧ AffineIndependent ℝ vertices ∧
(βˆ€ i j : Fin 4, i β‰  j β†’ dist (vertices i) (vertices j) = 2*Real.sqrt 2) ∧
volume.real tetrahedron = 8/3 ∧
CylinderCovering.minimumShadowArea tetrahedron = 2*Real.sqrt 2
abbrev MixedShape := HasMixedBase
def FiniteMixedStatement : Prop :=
βˆ€ a : ℝ, 0 < a β†’ a < 1/2 β†’ βˆ€ Ξ΅ : ℝ, 0 < Ξ΅ β†’
βˆƒ n : β„•, βˆƒ C : Fin n β†’ RuledApproximation.Cylinder,
(βˆ€ i, MixedShape (C i) ∧ IsCompact (C i).base) ∧
tetrahedron βŠ† RuledApproximation.familySet C ∧
RuledApproximation.familyArea C ≀
(Real.sqrt 2/4)*(CylinderCovering.BeamCost.beamCost a+
CylinderCovering.BeamCost.stripCost a)+Ξ΅
abbrev RegularCounterexampleStatement := RegularMixedCounterexampleStatement
abbrev ParameterPlane := EuclideanSpace ℝ (Fin 2)
def doubleSector (a : ℝ) (N : β„•) (i : Fin N) : Set ParameterPlane :=
{z | βˆƒ p ∈ CylinderCovering.RadialRiemann.cell 0 1 N i,
βˆƒ r ∈ Icc (-(1/(N:ℝ))) ((2-a)+1/(N:ℝ)),
z = !β‚‚[r*p,r*(1-p)]}
def midpointTag (N : β„•) (i : Fin N) : ℝ :=
(CylinderCovering.RadialRiemann.point 0 1 N i+
CylinderCovering.RadialRiemann.point 0 1 N (i+1))/2
def neighborhoodSector (a : ℝ) (N : β„•) (i : Fin N) : Set ParameterPlane :=
Metric.cthickening ((1/(N:ℝ))^2) (doubleSector a N i)
def neighborhoodBaseMinus (a : ℝ) (N : β„•) (i : Fin N) : Set Space :=
TriangularCovering.projection (axisMinus a (midpointTag N i)) ''
((fun z : ParameterPlane => point (-1+z 0) (-1+z 1) 0) '' neighborhoodSector a N i)
def neighborhoodBasePlus (a : ℝ) (N : β„•) (i : Fin N) : Set Space :=
TriangularCovering.projection (axisPlus a (midpointTag N i)) ''
((fun z : ParameterPlane => point (1-z 0) (1-z 1) 0) '' neighborhoodSector a N i)
def NeighborhoodAlternativeStatement : Prop :=
βˆ€ a : ℝ, 0 < a β†’ a < 1/2 β†’
βˆƒ errorConstant : ℝ, 0 ≀ errorConstant ∧
βˆƒ Cminus Cplus : (N : β„•) β†’ Fin N β†’ RuledApproximation.Cylinder,
βˆ€ N : β„•, 0 < N β†’
(βˆ€ i : Fin N,
(Cminus N i).axis = axisMinus a (midpointTag N i) ∧
(Cplus N i).axis = axisPlus a (midpointTag N i) ∧
Subtype.val '' (Cminus N i).base = neighborhoodBaseMinus a N i ∧
Subtype.val '' (Cplus N i).base = neighborhoodBasePlus a N i ∧
IsCompact (Cminus N i).base ∧ IsCompact (Cplus N i).base) ∧
beamMinus a βŠ† RuledApproximation.familySet (Cminus N) ∧
beamPlus a βŠ† RuledApproximation.familySet (Cplus N) ∧
(RuledApproximation.familyArea (Cminus N)+RuledApproximation.familyArea (Cplus N)) /
(Real.sqrt 2/4) ≀
CylinderCovering.BeamCost.beamCost a+errorConstant/(N:ℝ)
def FullStatement : Prop :=
GeometryStatement ∧ CoverageStatement ∧ FiniteBeamsStatement ∧ FiniteStripStatement ∧
CylinderCovering.BeamCost.CostStatement ∧ FiniteMixedStatement ∧
CanonicalCounterexampleStatement ∧ RegularCounterexampleStatement ∧
NeighborhoodAlternativeStatement
end ShortenedBeam
end
end OAI