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.
Every sublevel set of a convex function is convex
Statement
If is convex and , then
is a convex subset of . Empty and singleton sublevel sets are included.
Facts & Assumptions
Given: The function, domain, and level in the Statement, with convex subsets interpreted by A convex subset of contains every line segment between two of its points.
The function is convex when for all and (Convex and strictly convex functions on Euclidean convex sets).
Proof
If , then [F1] gives for every .
Thus every segment between two sublevel points remains in the sublevel set, which is convex. If it has fewer than two points, the same condition is vacuous.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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
- S. Boyd and L. Vandenberghe, Convex Optimization, §3.1.6 (standard reference, not scraped)