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.
Mixed Partials, Taylor Formulae, and Extrema: Examples and Counterexamples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- 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
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- 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
Peano's function has unequal mixed partials at the origin
Statement refuted
Refuted: existence of both mixed partial derivatives at a point forces them to be equal.
Facts & Assumptions
Given: away from and .
Clairaut--Schwarz requires continuous second partial derivatives on a neighbourhood, not merely their existence at one point (Clairaut--Schwarz theorem for continuous second partial derivatives).
Counterexample
Proof
For , , so ; for , , hence .
For , , so ; for , , hence .
Thus the two mixed partials exist and differ, while the continuity hypothesis in [L1] fails.
Peano's surface has a strict minimum on every line through the origin but no local extremum
Statement refuted
Refuted: a strict minimum of a function on every line through a point is a local minimum.
Facts & Assumptions
Given: .
Counterexample
Proof
On a nonvertical line , , which is positive for sufficiently small nonzero when ; on it is , and on the vertical line it is .
Along the parabola , for , whereas .
Hence is a strict linewise minimum but is not a local minimum in the sense of Local and strict local extrema for scalar fields on Euclidean open sets.
A smooth flat refinement has a strict minimum on every line through the origin but no local extremum
Statement refuted
Refuted: smoothness together with a strict minimum on every line through a point forces a local minimum.
Facts & Assumptions
Given: , for , and .
The exponential dominates every polynomial at infinity (The exponential dominates every fixed nonnegative integer power at ).
Counterexample
Proof
The flat function is smooth at : every derivative is a polynomial in times off and tends to by [L1].
Along , for .
On each line , the factor is smaller than every positive power of , so for sufficiently small nonzero ; the same holds on .
Thus is smooth and linewise strictly minimal at the origin but has no local minimum there.
has a unique critical point, a strict local but nonglobal minimum
Statement refuted
Refuted: a unique critical point which is a strict local minimum must be a global minimum.
Facts & Assumptions
Given: on .
A positive definite Hessian at a critical point gives a strict local minimum (The multivariable second-derivative test by definiteness of the Hessian).
Proof
The partial derivatives are and . Their simultaneous vanishing forces .
At , , which is negative for , whereas .
At the origin the Hessian is , so [L1] makes it a strict local minimum.
Thus the unique critical point is a strict local minimum but not a global one.
The monkey saddle has an indefinite higher-order critical point
Statement
The function has a critical point with zero Hessian at the origin, but the origin is a saddle.
Facts & Assumptions
Given: .
A semidefinite but not definite Hessian is inconclusive in the second-derivative test (The multivariable second-derivative test by definiteness of the Hessian).
Proof
The gradient is , and the Hessian entries are ; both vanish at the origin.
Along the -axis, , which has positive and negative values arbitrarily near .
Hence the origin is a saddle even though its Hessian is zero, illustrating the inconclusive case [L1].
A zero Hessian occurs at a strict minimum, a strict maximum, and a saddle
Statement refuted
Refuted: a zero Hessian determines the local type of a critical point.
Facts & Assumptions
Given: , , and .
The second-derivative test gives no conclusion for a semidefinite but not definite Hessian (The multivariable second-derivative test by definiteness of the Hessian).
Counterexample
Proof
Each displayed function has zero gradient and zero Hessian at .
is positive off the origin, so the origin is a strict local minimum; is negative off the origin, so it is a strict local maximum.
The values and have opposite signs for , so the origin is a saddle.
These three different local types share the same zero Hessian, exactly as the inconclusive clause [L1] permits.
A second-order Taylor polynomial computed from gradient and Hessian data
Statement
For , the second-order Taylor polynomial at the origin is .
Facts & Assumptions
Given: .
The second-order Taylor polynomial is determined by the value, gradient, and Hessian (Second-order Taylor expansion ).
The standard algebra rules compute the displayed derivatives (Sums, scalar multiples, products and quotients: , , , and when ).
Proof
At , , , and .
Substitution into [L1] gives , namely the claimed polynomial.
Thus the computed value, gradient, and Hessian yield the stated second-order approximation.
A constrained extremum on an affine graph satisfies the graph Lagrange rule
Statement
The minimum of on the graph occurs at and satisfies with .
Facts & Assumptions
Given: and .
The graph-constraint Lagrange rule is Lagrange multipliers for a regular graph constraint .
Proof
On the graph, , so the unique constrained minimum is .
At , . Hence the multiplier equation holds with , in accord with [L1].
This explicitly realizes the graph-constraint conclusion at the constrained minimum.
The degenerate constraint defeats the multiplier conclusion
Statement refuted
Refuted: every constrained local extremum satisfies , even when the constraint gradient vanishes.
Facts & Assumptions
Given: and .
The Jacobian and gradient use the convention of The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case.
Counterexample
Proof
The constraint set is the singleton , so has both a constrained local maximum and a constrained local minimum there.
At the origin, while .
No scalar can satisfy . Thus a regularity hypothesis is necessary for the usual multiplier conclusion.
Sources
Standard references
Recommended treatments; not extraction sources.