How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Continuity of the cyclic block-minimum value
Statement
Fix a block and define , where denotes all other blocks, is finite and continuous, and is proper closed convex. Suppose the minimizer map exists, is unique, and is continuous on the parameter set in question. Then is continuous there.
Facts & Assumptions
Given: The composite block problem and minimizer map in the Statement.
Cyclic exact block minimization: is the exact global minimizer of the th block slice.
Proper closed convex extended-real functions on : closed epigraph in finite dimensions is the lower-semicontinuity convention for .
is continuous and is single-valued and continuous on the parameter set.
Proof
Fix a parameter , let , and put . For , set . The weak sublevel is closed because is a continuous slice of the closed epigraph in [F2]; since , its open complement contains a neighborhood of on which . Continuity of and gives a relative neighborhood of on which lies in that neighborhood and both and differ from by less than . Hence .
For each , the point is a competitor, so . Together with step 1.1, this gives , which is continuity of at the arbitrary parameter . The argument uses neighborhoods and closed epigraphs directly; it does not infer topological continuity from a sequential criterion.
Depends on
Used by
Dependency tree · two levels
6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- P. Tseng, Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization, §§4–5 (standard reference, not scraped)
- Clément Royer, Regularized, Large-Scale and Distributed Optimization, Lecture 3, §3.2 (standard reference, not scraped)