Finite critical-value enumeration
Construction
Let K be a preabstract simplicial complex on an arbitrary type V, and suppose the face type TDA.Simplicial.TotalFace K is equipped with Fintype. For a
FilterFunction K α with [LinearOrder α], define
criticalValues f = Finset.univ.image f.value
criticalValue f = f.criticalValues.orderEmbOfFin rfl
gradeFiltration f =
TDA.Filtration.reindex f.criticalValue.toOrderHom f.sublevelFiltration
The finite set contains the distinct values on nonempty faces, so its cardinality counts
grades rather than faces. criticalValue lists those values in increasing order. The grade
filtration is exactly the existing sublevel filtration reindexed along this embedding.
Exact threshold recovery
The public laws in TDA.Filtration.CriticalValues establish that:
mem_criticalValuesidentifies membership with attainment on a face.criticalValues_eq_empty_iffcharacterizes the empty image byK = ⊥.criticalValue_memandexists_criticalValue_eqgive the two directions of coverage between the enumeration and face values.gradeFiltration_applyidentifies each indexed stage with its corresponding sublevel.sublevel_eq_bot_of_lt_firsthandles thresholds below the least grade.sublevel_eq_grade_of_gapidentifies the stage when the threshold lies below every later grade;sublevel_eq_grade_of_adjacentsupplies this hypothesis for adjacent grades.sublevel_eq_self_of_last_lesays a threshold at or above the greatest grade recoversK.sublevel_eq_bot_or_graderecovers every threshold: its sublevel is bottom or equals a grade at or below that threshold. Its proof takes the maximum of the finite set of critical values at most the threshold when that set is nonempty.
No bottom sentinel is inserted. A nonempty grade set starts at its least attained value, and
tied faces enter together. If K = ⊥, then the grade type is Fin 0; its filtration has an
empty index type and every ambient threshold still has bottom sublevel. The final-stage law
returns K, which can be strictly smaller than the ambient top complex.
A three-grade example
The private steppedFilter fixture in
CriticalValuesExamples.lean
uses the full complex on Fin 2, assigning integer values 0 to {0}, 2 to {1},
and 5 to {0,1}. Its critical values are 0, 2 and 5. The private proofs
stepped_thresholds and stepped_stage_faces give:
| Threshold | Recovered stage | Nonempty faces |
|---|---|---|
| −1 | Bottom, below the first grade | None |
| 0 or 1 | Stage 0, at critical value 0 | {0} |
| 2 or 4 | Stage 1, at critical value 2 | {0}, {1} |
| 5 or 6 | Stage 2, at critical value 5 | {0}, {1}, {0,1} |
Stage 0 already contains the first vertex; it is not an added bottom stage.
The last row is ambient top because this fixture's input complex is top.
The general last-grade law returns the input K.
Assumptions and scope
The general API assumes only a linear order on α, the existing complex K on V, and a
supplied Fintype (TDA.Simplicial.TotalFace K). It adds no order, finiteness, decidable
equality, or nonemptiness assumption on V, and no inhabitedness or density assumption on
α. Empty V and empty α are allowed where the existing types and instances permit
them. The result is a theory-side finite enumeration from supplied data; it does not construct
that data from a finite presentation.
Source correspondence
This construction extends the existing face-value sublevel API directly:
TDA/Filtration/FilterFunction.lean(blobbcf4907aaec0a1cb2ce116c661230a115fdf4a65) defines the face domain, sublevel membership, monotonicity, and bottom/self endpoint lemmas.TDA/Filtration/Basic.lean(blob77a63f98ba6e7c3cbfe6fc92f6a51014643ef32f) suppliesSimplicialFiltration,reindex, and its evaluation law.TDA/Simplicial/Bridge.lean(bloba811965673ef1d3da54efe0aef768bcbf3ae1d50) supplies the type of nonempty faces.Mathlib.Data.Finset.Sortat pinned mathlib revision0df444a360eaa60ab8c11dca51a86af692955474suppliesFinset.orderEmbOfFinand the increasing finite enumeration used here.
The membership, endpoint, plateau, and threshold-recovery proofs are direct consequences of these definitions and finite ordered-set facts. No external persistence theorem is translated or claimed. This module does not construct a finite complex presentation, choose a compatible simplex order, or establish homology, barcode, stability, or Reeb results.