-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathConditionalMainTheorem.lean
More file actions
29 lines (24 loc) · 1.07 KB
/
Copy pathConditionalMainTheorem.lean
File metadata and controls
29 lines (24 loc) · 1.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
import Feige.GeometryBridge
import Feige.Sharpness
/-!
# Conditional assembly of the unit-slack theorem
This module states the `δ = 1` specialization of the paper's main result in
terms of three structural inputs. The reduction and extremal construction
are fully discharged: Theorem 2.1, the simplex/exponential identification
of (2.1), and the `α = 0` centroid-halfspace inequality are the only inputs.
-/
namespace Feige
/-- The `δ = 1` specialization of Theorem 1.1, assembled from Theorem 2.1
and the two geometric facts identifying and bounding the Dirichlet
statistic. -/
theorem sharp_unit_slack_feige_of_paper_inputs
{n : ℕ} (hn : 0 < n)
(hcal : UniversalCalibration
(dirichletK : (Fin n → ℝ) → ℝ))
(hid : SimplexExponentialIdentification n)
(hcentroid : SimplexCentroidHalfspaceProperty (ι := Fin n)) :
IsOptimalFixedDimensionalFeigeBound n (sharpConstant n) := by
exact sharpConstant_is_optimal_of_structural_inputs hn
(dirichletK : (Fin n → ℝ) → ℝ) hcal
(dirichletK_largeSumBridge_of_simplex hid hcentroid)
end Feige