Maximal Positive-Volume Simplex in a Compact Set
ProvedFunctionalInequalities.Analysis.exists_max_simplexEdgeMatrix_det_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concave
This establishes existence of a maximal-volume simplex in a compact set with nonempty interior.
Let be compact and assume . Then there exists a map such that:
- Every vertex belongs to .
- The simplex edge matrix has positive determinant magnitude:
- Every other -tuple of points in has no larger determinant magnitude:
The declaration is exists_max_simplexEdgeMatrix_det_readable. It is the compactness and normalization step for selecting a nondegenerate maximal simplex.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem exists_max_simplexEdgeMatrix_det {n : ℕ} {K : Set (EuclideanSpace ℝ (Fin n))}
(hK : IsCompact K) (hint : (interior K).Nonempty) :
∃ v : Fin (n + 1) → EuclideanSpace ℝ (Fin n), (∀ i, v i ∈ K) ∧
0 < |(simplexEdgeMatrix v).det| ∧
∀ w : Fin (n + 1) → EuclideanSpace ℝ (Fin n), (∀ i, w i ∈ K) →
|(simplexEdgeMatrix w).det| ≤ |(simplexEdgeMatrix v).det|
Module navigation
Module: Analysis/Convex/Normalization.
Next: abs_simplexCoord_le_one_of_max.
Source excerpt, lines 31–36 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_Normalization
Formal statement
theorem FunctionalInequalities.Analysis.exists_max_simplexEdgeMatrix_det_readable {n : ℕ} {K : Set (EuclideanSpace ℝ (Fin n))}
(hK : IsCompact K) (hint : (interior K).Nonempty) :
∃ v : Fin (n + 1) → EuclideanSpace ℝ (Fin n), (∀ i, v i ∈ K) ∧
0 < |(simplexEdgeMatrix v).det| ∧
∀ w : Fin (n + 1) → EuclideanSpace ℝ (Fin n), (∀ i, w i ∈ K) →
|(simplexEdgeMatrix w).det| ≤ |(simplexEdgeMatrix v).det| := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Convex/Normalization.lean#L29-L121 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Convex.Normalization`, declaration `FunctionalInequalities.Analysis.exists_max_simplexEdgeMatrix_det`; the repository is private at upload time).