Shifted sublevel inclusions at the finite-face discrepancy
DefinitionLPCA_Solutions_LPCA_InterleavedFiltrations_Defscommutative-algebralocal-cohomologylocalized-persistent-commutative-algebralpca-attachment-20261021stanley-reisner
This bundle supplies shifted sublevel inclusions at the finite-face discrepancy. The bundle contains the selected declarations used by this attachment checkpoint, with the hypotheses of their Lean statements retained. Its role as a dependency does not assert a stronger comparison, scalar compatibility or persistence theorem than those declarations state.
The included constructions and necessary compatibility results are:
- Supremum distance on the actual finite face family. Including zero makes the same definition valid for the void complex, with distance zero.
Definition code
import Mathlib.Algebra.Homology.LocalCohomology
import Mathlib.CategoryTheory.Category.Preorder
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Real.Basic
import Mathlib.Order.ConditionallyCompleteLattice.Finset
import Mathlib.RingTheory.Ideal.Quotient.Operations
import Mathlib.RingTheory.Localization.Away.Basic
import Mathlib.RingTheory.MvPolynomial.Basic
import Definitions.Def_LPCA
import Definitions.Def_LPCA_Solutions_LPCA_FiltrationFunctor_Defs
set_option autoImplicit false
namespace LPCA
universe u
variable {V : Type u} [DecidableEq V]
/-- Supremum distance on the actual finite face family. Including zero
makes the same definition valid for the void complex, with distance zero. -/
noncomputable def filtrationDiscrepancy (K : Complex V) (f g : Finset V → ℝ) : ℝ :=
(insert 0 (K.faces.image (fun F => |f F - g F|))).sup' (Finset.insert_nonempty _ _) id
theorem filtrationDiscrepancy_nonneg (K : Complex V) (f g : Finset V → ℝ) :
0 ≤ filtrationDiscrepancy K f g := by
exact Finset.le_sup' id (Finset.mem_insert_self 0 _)
theorem abs_face_difference_le_discrepancy (K : Complex V) (f g : Finset V → ℝ)
(F : Finset V) (hF : F ∈ K.faces) :
|f F - g F| ≤ filtrationDiscrepancy K f g := by
have hm : |f F - g F| ∈ insert (0 : ℝ) (K.faces.image (fun G => |f G - g G|)) :=
Finset.mem_insert_of_mem (Finset.mem_image.mpr ⟨F, hF, rfl⟩)
exact Finset.le_sup' id hm
theorem level_shift_subset_of_abs_le (K : Complex V) (f g : Finset V → ℝ)
(hf : FiltrationMonotone K f) (hg : FiltrationMonotone K g)
(ε : ℝ) (hfg : ∀ F ∈ K.faces, |f F - g F| ≤ ε) (t : ℝ) :
(level K f hf t).faces ⊆ (level K g hg (t + ε)).faces := by
intro F hF
obtain ⟨hFK, hFt⟩ := Finset.mem_filter.mp hF
refine Finset.mem_filter.mpr ⟨hFK, ?_⟩
have hdiff : g F - f F ≤ |f F - g F| := by
simpa only [abs_sub_comm] using le_abs_self (g F - f F)
have hb := hfg F hFK
linarith
end LPCA
Source