Both roofs are graph-hull fiber extrema
ProvedQAlgorithms.Papers.Independent.Support50.P35.roof_graph_fiberLet be a nonempty compact irreducible nonsingular real affine algebraic variety, let be continuous, and let . Define the lower and upper roofs by the infimum and supremum, respectively, of over every positive finite length , points , and real weights with and . Writing , one has
The hull is the finite convex hull. Compactness and continuity make the fiber nonempty and bounded, so these are actual finite real extrema values. This identifies the roofs with the lower and upper fiber boundaries.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P35
noncomputable section
open scoped Matrix ComplexConjugate Topology Manifold
namespace QAlgorithms.Papers.Independent.Support50.P35
/-- PDF pp.5--6, Lemma 2.2: both roofs are extrema of the actual finite
convex-hull fiber. All standing variety and continuity assumptions are retained. -/
theorem roof_graph_fiber {n : ℕ} (V : Set (Fin n → ℝ))
(hV : IsNonsingularVariety V) (hcompact : IsCompact V) (hne : V.Nonempty)
(f : (Fin n → ℝ) → ℝ) (hf : ContinuousOn f V)
(r : Fin n → ℝ) (hr : r ∈ convexHull ℝ V) :
lowerRoof V f r = sInf {a : ℝ | (r, a) ∈ convexHull ℝ (graphOn V f)} ∧
upperRoof V f r = sSup {a : ℝ | (r, a) ∈ convexHull ℝ (graphOn V f)} := by sorry
end QAlgorithms.Papers.Independent.Support50.P35
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any natural number and be compact and nonempty. Assume that, writing for the ideal of real polynomials vanishing on , the set equals the common zero set of , the ideal is prime, and there exists a natural number such that admits a -dimensional real manifold structure whose inclusion into is an immersion and, at every , the real linear span of has dimension . Let be continuous on , and let belong to the real convex hull of . For each positive integer , consider points and weights satisfying and ; zero weights and repeated points are permitted. Define and respectively as the infimum and supremum of all values arising this way, and define . Then both equalities hold:
The statement includes and does not assert uniqueness of a decomposition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.