OAI/Analysis/CircleDomains/Selection/BandGraph.lean
16 declarations, 0 contain sorry, 0 declared as axioms
+# Compact interval-band graphs for bounded real coordinates
Take the closure of the physical graph and fill the interval between cluster values in each fiber. This constructs a compact band graph; on the open physical domain it is exactly the original graph. Its projection modulo one consequently gives compact level sets with the correct physical fibers.
- def
OAI.CircleDomainRigidity.clusterGraphline 19 - def
OAI.CircleDomainRigidity.intervalFiberHullline 22 - theorem
OAI.CircleDomainRigidity.isCompact_clusterGraphline 27 - theorem
OAI.CircleDomainRigidity.isCompact_intervalFiberHullline 36 - theorem
OAI.CircleDomainRigidity.mem_intervalFiberHull_iffline 44 - theorem
OAI.CircleDomainRigidity.subset_intervalFiberHullline 57 - theorem
OAI.CircleDomainRigidity.isCompact_real_fiberline 63 - theorem
OAI.CircleDomainRigidity.intervalFiberHull_fiber_eq_Iccline 81Source documentation
The interpolated fiber is exactly the interval between the smallest and largest cluster values, with the endpoints attained in the compact original fiber.
theorem intervalFiberHull_fiber_eq_Icc {X : Type*} [TopologicalSpace X] [T2Space X] {K : Set (X × ℝ)} (hK : IsCompact K) (x : X) (hne : {t : ℝ | (x, t) ∈ K}.Nonempty) : {t : ℝ | (x, t) ∈ intervalFiberHull K} = Icc (sInf {t : ℝ | (x, t) ∈ K}) (sSup {t : ℝ | (x, t) ∈ K}) := by … - theorem
OAI.CircleDomainRigidity.clusterGraph_fiber_nonempty_of_mem_closureline 112 - theorem
OAI.CircleDomainRigidity.clusterGraph_fiber_eq_of_continuousAtline 124 - theorem
OAI.CircleDomainRigidity.intervalFiberHull_clusterGraph_on_openline 134 - def
OAI.CircleDomainRigidity.circleBandGraphline 148 - theorem
OAI.CircleDomainRigidity.isCompact_circleBandGraphline 153 - theorem
OAI.CircleDomainRigidity.circleBandGraph_on_openline 159 - theorem
OAI.CircleDomainRigidity.isCompact_circleBandLevelline 171 - theorem
OAI.CircleDomainRigidity.isCompact_circleBandIncidenceline 176