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.
Convexity: Examples and Counterexamples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The absolute-value function is convex
Example
The function is convex on . Indeed, for ,
by the triangle inequality (The triangle inequality) and absolute homogeneity (Basic properties of the absolute value), which is precisely the convexity inequality (Convex, strictly convex, concave, strictly concave, and midpoint-convex real functions on an interval).
Remarks
Convexity does not entail differentiability at every point; the nondifferentiability of absolute value at zero is recorded in is continuous everywhere and not differentiable at : the difference quotient equals on the right and on the left, so the two one-sided limits differ but is not a dependency of this example.
Finite Jensen for gives that the square of a weighted mean is at most the weighted mean of the squares
Example
For nonnegative weights with and real ,
The function is convex because
for , using nonnegativity of squares (Squares of nonzero elements are positive). Applying finite Jensen (Finite Jensen inequality for a convex function and nonnegative weights summing to one) to gives the displayed inequality.
Assuming Choice, a Hamel coefficient map is midpoint convex but discontinuous and therefore not convex
Statement refuted
Every midpoint-convex function is continuous, and hence convex.
Facts & Assumptions
Given: The Axiom of Choice.
Assuming Choice, a Hamel basis has a coefficient map that is additive, has for its selected basis vector, and has a nonzero kernel (Assuming the Axiom of Choice, has a Hamel basis over : there is such that every real is a finite -linear combination of elements of in exactly one way, and each basis vector carries a well-defined -linear coefficient map).
An additive function satisfying any listed regularity condition, including continuity at one point, equals (Six regularity conditions each force an additive to be : continuity at a single point, monotonicity on a nondegenerate interval, boundedness above on one, boundedness below on one, constancy of sign on one, and a graph that is not dense in ).
A convex real function is continuous at every interior point of its interval domain (A convex real function is Lipschitz on every closed bounded subinterval of the interior of its domain, hence continuous throughout the interior).
Counterexample
Choose a Hamel coefficient map from [L1]. Additivity gives , so is midpoint convex with equality.
Suppose for contradiction that is continuous. Then [L2] gives ; a nonzero in its kernel forces , whereas , a contradiction.
Thus is discontinuous. By [L3], this midpoint-convex function cannot be convex.
changes from concave to convex at zero and has an inflection point there
Example
For , the power rule gives (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term). It is negative on and positive on , while is continuous at . Therefore the sign-change criterion (A continuous function whose second derivative has opposite signs on the two sides of a point has an inflection point there) makes an inflection point (An inflection point as a point of continuity where convexity changes to concavity or conversely).
Sources
Standard references
Recommended treatments; not extraction sources.