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.
A convex function on that is discontinuous at the boundary
Statement refuted
Every convex real-valued function on a convex subset of Euclidean space is continuous on its whole domain.
The counterexample below establishes: The function is convex on but is not continuous at .
Facts & Assumptions
Given: Define by and for .
The function is convex when for all and (Convex and strictly convex functions on Euclidean convex sets).
Every convex function on an open convex set is continuous on that set (A convex function on an open convex set is continuous).
Counterexample
A convex combination of two domain points equals zero only when every endpoint having positive weight is zero. In that case [F1] is an equality. Otherwise the left side is zero and the right side is nonnegative, so [F1] again holds.
For every positive , , whereas , so the right-hand limit at zero is not the function value. The function is convex on but is not continuous at . This does not contradict [L1], because the domain is not open at zero.
Depends on
Used by
- FALSE: a convex function on a convex set is continuous False statement
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
- S. Boyd and L. Vandenberghe, Convex Optimization, §3.1 (standard reference, not scraped)