Documentation

IntroductoryLecturesOnConvexOptimization_Nesterov_2004.Chap02.Lemma_2_1

Statements

Source excerpts; proofs omitted. recall restates an existing declaration; #check records an expression, not its inferred type.

Lemma 2.1 lies in the first-order convex-analysis function-class domain for the source-facing class ๐“•ยน(Q). Sampled owner-style declarations: - mathlib ContDiffOn.const_smul - mathlib ConvexOn.smul - mathlib ConvexOn.add - Chapter 2 ConvexC1On in Definition_2_4 Best owner abstraction: - ConvexC1On, the chapter owner for the source class ๐“•ยน(Q). Primitive data: - the feasible set Q - the objective functions fโ‚, fโ‚‚ - the owner hypotheses ConvexC1On Q fโ‚ and ConvexC1On Q fโ‚‚ Derived API: - owner closure under nonnegative scalar multiplication and addition - the weighted-sum closure theorem ConvexC1On.nonneg_combo Source/core/bridge triage: - source-facing: the textbook closure of ๐“•ยน(Q) under nonnegative linear combinations - core/canonical: ConvexC1On.nonneg_combo - bridge/view: the notation ๐“•ยน(Q) as the set-level source presentation of the owner predicate This numbered item is therefore a direct owner recall rather than a second declaration site.

recall ConvexC1On.nonneg_combo

Lean source

Module source