Documentation

IntroductoryLecturesOnConvexOptimization_Nesterov_2004.Chap01.Definition_1_2_3

Statements

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

Definition 1.2.3 is a source-facing recall in the black-box stopping-criterion domain. Layer targeted by this refinement: * source-facing recall of the core/canonical owner expression already used elsewhere in Chapter 1 Primary domain: * stopping predicates on the informational state of a black-box method Relevant owner-style declarations sampled before refining: * Set in mathlib, the owner type of accepted-state predicates; * Set.mem_setOf in mathlib, the canonical bridge between the set and predicate views; * GeneralIterativeScheme.shouldStop in Algorithm_1_2_10.lean, which stores the stopping rule directly as Set (Set (Query × Answer)); * GeneralIterativeScheme.HaltsAt in Algorithm_1_2_10.lean, which derives halting from membership in that accepted-state set. Source/core/bridge triage: * source-facing: the ε-stopping rule itself; * core/canonical: the accepted-state set Set State; * bridge/view: Set.mem_setOf, which converts between set-builder and predicate syntax. Owner abstraction: * the accepted-state predicate/set Set State Primitive data: * the informational-state type State * the accepted-state set itself Derived API: * set-builder membership via Set.mem_setOf * downstream consumers such as GeneralIterativeScheme.shouldStop * halting predicates such as GeneralIterativeScheme.HaltsAt This recall file intentionally introduces no separate public wrapper such as StoppingCriterion. The positivity witness 0 < ε belongs to the ambient method/problem data that owns the stopping rule, not to the stopping rule itself.

#check (Set State)

Lean source

Source context
universe u
variable {State : Type u}
recall Set.mem_setOf
    {x : State} {p : State → Prop} :
    x ∈ {y | p y} ↔ p x

Lean source

Source context
universe u
variable {State : Type u}

Module source