Alphabeta Math
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.

✓ 17 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 17 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Darboux, L'Hôpital, and Taylor's Theorem

1 · Prerequisites

2 · Summary

The derivative and mean value theorems supply Rolle's theorem, Cauchy's mean value theorem, and the algebra of derivatives. Finite counting supplies binomial coefficients and Pascal's rule. Together these prerequisites support repeated differentiation, quotient comparisons, and finite Taylor polynomials without presupposing power-series theory.

Higher derivatives and smoothness lead to the general Leibniz rule and higher-order Rolle arguments. Darboux's theorem then controls the intermediate values of derivatives, while the two L'Hôpital theorems treat the zero-over-zero and infinity-over-infinity forms. Taylor polynomials culminate in the Schlömilch-Roche, Lagrange, Cauchy, and Peano remainders, followed by remainder bounds and derivative tests for local extrema.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-01Open item page →

Higher derivatives and the classes Ck and C∞

Definition

Let I⊆R be an interval and f:I→R. Put f(0):=f. Recursively, wherever f(j) is differentiable, put f(j+1):=(f(j))′, with derivatives at endpoints understood in the one-sided sense fixed by The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set and The left and right limits of f at c, as limits of the restrictions of f to A∩(−∞,c) and A∩(c,∞).

For k∈N, the function is k-times differentiable on I if f(j) exists on I for every j≤k. It is of class Ck on I if these derivatives exist and every f(j), 0≤j≤k, is continuous on I (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point). It is smooth, or C∞, if it is Ck for every k∈N.

Since 0∈N (The natural numbers N (von Neumann)), C0 means continuity. The definitions also give Ck+1⊆Ck. Existence of f(k) alone does not assert that f(k) is continuous.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

The general Leibniz rule for the n-th derivative of a product

Statement

If n∈N and f,g are n-times differentiable on an interval I, then (fg)(n)=∑j=0nι ⁣(nj) f(j)g(n−j).

Facts & Assumptions

Proof

technique · induction
1.1

For n=0, the displayed sum is ι(00)f(0)g(0)=fg=(fg)(0).

baseL2
1.2

Assume the formula holds at an index k, and assume f,g have derivatives through order k+1.

ihassume-hyp
2.1

Differentiating the finite sum gives (fg)(k+1)=∑j=0kι(kj)(f(j+1)g(k−j)+f(j)g(k−j+1)).

step 1.2L1L3
3.1

Shift j+1 in the first sum, retain j in the second, and combine the two interior coefficients by Pascal's rule; the two boundary coefficients are 1. The result is (fg)(k+1)=∑j=0k+1ι(k+1j)f(j)g(k+1−j).

step 2.1L2L3algebra
4.1

Thus the formula holds for every n∈N.

step 1.1step 3.1discharge-induction∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

Higher-order Rolle theorem

Statement

Let n∈N with n≥1, let x0<⋯<xn, and let f be continuous on [x0,xn] and n-times differentiable on (x0,xn). If f(xj)=0 for every j≤n, then some c∈(x0,xn) satisfies f(n)(c)=0.

Facts & Assumptions

Given: The ordered zeros and the stated regularity.

[L1]
[L2]

Differentiability at a point implies continuity there (A function differentiable at c is continuous at c), and induction applies to natural numbers (The principle of mathematical induction).

Proof

technique · induction
1.1

For n=1, Rolle's theorem on [x0,x1] gives c∈(x0,x1) with f′(c)=0.

baseL1
1.2

For n≥2, apply Rolle on each [xj−1,xj] to obtain yj∈(xj−1,xj) with f′(yj)=0, so y1<⋯<yn.

givenL1choose
2.1

The function f′ is continuous on [y1,yn], because those points lie in (x0,xn) and the existence of f′′ gives continuity there; it is (n−1)-times differentiable on (y1,yn). Apply the induction hypothesis of order n−1 to f′ and the n ordered zeros y1,…,yn. This gives c∈(y1,yn)⊂(x0,xn) with (f′)(n−1)(c)=f(n)(c)=0.

step 1.2L2ih
3.1

The claim follows for every n≥1.

step 1.1step 2.1L2discharge-induction∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

Darboux's theorem: every derivative has the intermediate-value property

Statement

If I⊆R is an interval and f:I→R is differentiable, then f′ has the intermediate value property (The intermediate value property (Darboux property) of a function on an interval: the image of every subinterval is order-convex).

Facts & Assumptions

Given: x<y in I and a real λ between f′(x) and f′(y).

[L1]

Differentiability implies continuity; the closed bounded interval [x,y] is compact; and a continuous real function on a nonempty compact set attains its extrema (A function differentiable at c is continuous at c, Heine-Borel by bisection: every closed bounded interval [a,b] is compact, Extreme value theorem: a continuous real function on a nonempty compact subset of R attains a greatest and a least value).

Proof

technique · cases
1.1

If λ=f′(x) or λ=f′(y), choose that endpoint.

assume-case endpointgiven
1.2

Suppose f′(x)<λ<f′(y), and define h(t)=f(t)−λt on [x,y]. Then h′(x)<0<h′(y).

assume-case increasingL3algebra
1.3

If instead f′(y)<λ<f′(x), apply the preceding argument to −h, obtaining an interior extremum of h.

assume-case decreasingL1L3
2.1

For sufficiently small positive s,t, the derivative inequalities give h(x+s)<h(x) and h(y−t)<h(y). Hence a minimum of h on [x,y] occurs at an interior point c.

step 1.2L1choose
3.1

In either strict-order case, Fermat gives h′(c)=0, hence f′(c)=λ. Together with the endpoint case, every intermediate value is attained.

step 2.1step 1.3L2L3cases-exhaustive∎
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

A derivative has neither a removable discontinuity nor a jump discontinuity

Statement

A derivative has neither a removable discontinuity nor a jump discontinuity. Any discontinuity of a derivative is therefore essential in the classification of Discontinuity of f at a point of its domain, and its classification: removable discontinuity, jump discontinuity and essential discontinuity, equivalently Rudin's discontinuities of the first and of the second kind.

Proof

technique · contradiction
1.1

Assume c is removable. Choose a value strictly between the common punctured limit and g(c). On a sufficiently small punctured neighbourhood all values of g lie on the limit side of that value, while the endpoint value lies on the other side, contradicting the intermediate value property on a segment ending at c.

assume-contraL1L2choose
1.2

Assume c is a jump. The open interval between the unequal one-sided limits contains a value different from g(c); choose such a value. Sufficiently close points on the two sides have values on opposite sides of the chosen value, while neither punctured side nor the point c takes it, again contradicting the intermediate value property.

assume-contraL1L2choose
2.1

Thus neither kind of discontinuity can occur.

step 1.1step 1.2discharge-contradiction∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

An injective Darboux function on an interval is strictly monotone

Statement

An injective function f:I→R on an interval I with the intermediate value property is strictly monotone.

Facts & Assumptions

Given: An injective Darboux function f on an interval I.

[L1]

The pointwise Darboux property in The intermediate value property (Darboux property) of a function on an interval: the image of every subinterval is order-convex attains every value between f(a) and f(b) on [a,b].

Proof

technique · contradiction
1.1

For any a<b<c in I, f(b) must lie strictly between f(a) and f(c). Indeed, if it lies above both, a value strictly between max⁡{f(a),f(c)} and f(b) is attained once in (a,b) and once in (b,c), contradicting injectivity; the case below both is analogous.

assume-contraL1given
2.1

Fix a<b. If f(a)<f(b), step 1.1 forces f(x)<f(y) for every x<y in I; inserting points between or beyond a,b proves all possible placements. If f(b)<f(a), the symmetric argument gives strict decrease.

step 1.1L2cases
3.1

Injectivity excludes equality, so one of the two alternatives holds and f is strictly monotone.

step 2.1discharge-contradiction∎
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

An injective or monotone derivative on an interval is continuous

Statement

Let f be differentiable on an interval. If f′ is injective, or if f′ is monotone, then f′ is continuous.

Facts & Assumptions

Given: The derivative f′ and one of the two stated hypotheses.

[L1]

Every derivative has the intermediate value property (Darboux's theorem: every derivative has the intermediate-value property).

[L2]

An injective Darboux function is strictly monotone (An injective Darboux function on an interval is strictly monotone).

Proof

technique · cases
1.1

If f′ is injective, [L1] and [L2] make it strictly monotone. If it is increasing, [L1] and [L3] make it continuous; if it is decreasing, apply [L3] to −f′, whose interval images are the negatives of the interval images of f′.

assume-case injectiveL1L2L3
1.2

If f′ is nondecreasing, [L1] and [L3] make it continuous. If it is nonincreasing, the same argument applied to −f′ gives continuity.

assume-case monotoneL1L3
2.1

These are the two stated alternatives.

step 1.1step 1.2cases-exhaustive∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

Cauchy's mean-value theorem in quotient form when the denominator derivative is nonzero

Statement

Let a<b. If f,g are continuous on [a,b], differentiable on (a,b), and g′(x)≠0 throughout (a,b), then g(b)≠g(a) and there is c∈(a,b) such that f(b)−f(a)g(b)−g(a)=f′(c)g′(c).

Facts & Assumptions

Proof

technique · direct
1.1

If g(a)=g(b), Rolle gives d∈(a,b) with g′(d)=0, contrary to the hypothesis. Hence g(b)−g(a)≠0.

L2given
1.2

Cauchy's theorem supplies c∈(a,b) with the cross-product identity in [L1].

L1
2.1

Divide that identity by the two nonzero factors g(b)−g(a) and g′(c) to obtain the quotient formula.

step 1.1step 1.2algebra∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

L'Hôpital's rule for the 0/0 form at finite or infinite, one-sided endpoints

Statement

Let c∈R and let f,g be differentiable on a deleted one-sided or two-sided neighbourhood of c, with g′≠0 there. Suppose f(x)→0, g(x)→0 as x→c in the chosen mode. If f′(x)/g′(x)→L∈R‾, then f(x)/g(x)→L in the same mode. The analogous statement at +∞ or −∞ follows after the substitution t=1/x, wherever the transformed functions are defined.

Facts & Assumptions

Given: The hypotheses and one fixed approach mode.

[L1]

Differentiability implies continuity, and the Cauchy quotient lemma gives a point between two arguments at which a secant quotient equals a derivative quotient (A function differentiable at c is continuous at c, Cauchy's mean-value theorem in quotient form when the denominator derivative is nonzero).

Proof

technique · direct
1.1

Extend f,g to c by f(c)=g(c)=0. Their continuity at c follows from the assumed zero limits, while differentiability gives continuity at every other point of the segment. For x≠c sufficiently close, the quotient lemma on the segment with endpoints c,x gives f(x)g(x)=f′(ξx)g′(ξx), where ξx lies strictly between c and x.

givenL1L2
2.1

As x→c in the chosen mode, ξx→c in that mode. Applying the defining finite or infinite limit inequality to the derivative quotient therefore gives f(x)/g(x)→L.

step 1.1L2
3.1

At infinity, put F(t)=f(1/t), G(t)=g(1/t). Then F′/G′=f′(1/t)/g′(1/t), since the common factor −1/t2 cancels. Apply steps 1.1 and 2.1 as t→0+ or 0−, and translate back.

L3step 2.1algebra∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

L'Hôpital's rule for the ∞/∞ form at finite or infinite, one-sided endpoints

Statement

Let f,g be differentiable on a one-sided neighbourhood of c, or on a tail at +∞ or −∞, with g′≠0. Suppose ∣f(x)∣→∞ and ∣g(x)∣→∞ in the selected mode, with each numerator and denominator eventually of fixed sign. If f′(x)/g′(x)→L∈R‾, then f(x)/g(x)→L.

Facts & Assumptions

Proof

technique · direct
1.1

Fix a base point a inside the domain. For variable x farther toward the limiting end, [L1] gives f(x)−f(a)g(x)−g(a)=f′(ξx)g′(ξx), where ξx lies between a and x.

givenL1
2.1

First choose a sufficiently far toward the end that the derivative quotient is as close to L as required throughout the remaining tail. Then the quotient of increments has the same bound for every later x.

step 1.1L2choose
3.1

Since ∣g(x)∣→∞, g(a)/g(x)→0; since the increment quotient is bounded in the finite-L case, the identity f(x)g(x)=f(x)−f(a)g(x)−g(a)(1−g(a)g(x))+f(a)g(x) gives the finite conclusion. For L=±∞, choose the derivative-quotient lower or upper bound first and then make the two fixed-base terms negligible, obtaining the defining arbitrary bound.

step 2.1L2algebra
4.1

Thus the quotient has limit L in every stated mode.

step 3.1∎
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-01Open item page →

Taylor polynomials and their remainders

Definition

Let n∈N, let f have derivatives through order n at a, and let ι:N→R be the canonical embedding. The Taylor polynomial of degree at most n about a is Tn,af(x):=∑j=0nf(j)(a)ι(j!)(x−a)j. The Taylor remainder is Rn,af(x):=f(x)−Tn,af(x).

The factorials are natural numbers as in The factorial n! and the falling factorial nk‾, defined by recursion in N and enter real arithmetic only through ι (The canonical natural ι(n)=n⋅1F of a field); they are nonzero (Canonical naturals are positive and strictly increasing). The sum and powers are those of Finite sums and finite products, by recursion, Laws of finite sums and finite products, and Integer powers am. For n=0, T0,af is the constant f(a).

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

Taylor polynomials match the prescribed derivatives at the centre

Statement

For 0≤r≤n, (Tn,af)(r)(x)=∑j=rnf(j)(a)ι((j−r)!)(x−a)j−r. Consequently (Tn,af)(r)(a)=f(r)(a), and Rn,af and its derivatives through order n vanish at a.

Facts & Assumptions

Proof

technique · induction
1.1

At r=0 the formula is the definition.

basegiven
1.2

Assuming the formula at r<n, differentiate termwise. The term indexed j acquires ι(j−r), which cancels ι((j−r)!) to ι((j−r−1)!); the j=r constant term disappears. This is the formula at r+1.

ihL1L2algebra
2.1

At x=a, only the j=r term survives and equals f(r)(a). Subtraction from f(r)(a) gives the remainder assertion.

step 1.2L1algebra
3.1

The formula and both consequences hold through order n.

step 1.1step 2.1discharge-induction∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

Taylor's Schlömilch–Roche remainder formula

Statement

Let n∈N, let a<x, and suppose f has derivatives through order n+1 on [a,x], with the usual endpoint continuity. For every natural p with 1≤p≤n+1, some ξ∈(a,x) satisfies Rn,af(x)=f(n+1)(ξ)ι(p) ι(n!)(x−ξ)n+1−p(x−a)p. The reflected formula holds when x<a.

Facts & Assumptions

Proof

technique · direct
1.1

Define Φ(t):=f(x)−∑j=0nf(j)(t)(x−t)j/ι(j!) and Ψ(t):=(x−t)p. Telescoping after differentiating the sum gives Φ′(t)=−f(n+1)(t)(x−t)n/ι(n!), while Ψ′(t)=−ι(p)(x−t)p−1.

L1L3algebra
1.2

We have Φ(a)=Rn,af(x), Φ(x)=0, Ψ(a)=(x−a)p, and Ψ(x)=0. Also Ψ′≠0 on (a,x), because p≥1, ι(p)>0, and x−t>0.

givenL1L4algebra
2.1

Apply [L2] to Φ,Ψ. For some ξ∈(a,x), Φ(a)/Ψ(a)=Φ′(ξ)/Ψ′(ξ)=f(n+1)(ξ)(x−ξ)n+1−p/(ι(p)ι(n!)).

step 1.1step 1.2L2
3.1

Multiply by (x−a)p. If x<a, interchange the interval endpoints; the same algebraic identity results.

step 2.1algebra∎
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

The Lagrange and Cauchy forms of Taylor's remainder

Statement

Under the hypotheses of Taylor's Schlömilch–Roche remainder formula, there are points ξL,ξC between a and x such that Rn,af(x)=f(n+1)(ξL)ι((n+1)!)(x−a)n+1 and Rn,af(x)=f(n+1)(ξC)ι(n!)(x−ξC)n(x−a).

Facts & Assumptions

Given: The hypotheses of the Schlömilch-Roche theorem.

[L1]

For each natural 1≤p≤n+1, the Schlömilch-Roche theorem gives a point ξ strictly between a and x such that Rn,af(x)=f(n+1)(ξ)ι(p)ι(n!)(x−ξ)n+1−p(x−a)p. (Taylor's Schlömilch–Roche remainder formula).

Proof

technique · direct
1.1

Set p=n+1 in [L1]. Then (x−ξ)0=1 and ι(n+1)ι(n!)=ι((n+1)!), giving the Lagrange form.

L1L2algebra
1.2

Set p=1. Since ι(1)=1, the formula becomes the Cauchy form.

L1L2algebra
2.1

These are the asserted special cases.

step 1.1step 1.2∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

Peano's form: the normalized Taylor remainder tends to zero

Statement

Let n≥1. If there is a real δ>0 such that f is n-times differentiable on the open interval Nδ(a)=(a−δ,a+δ), then Rn,af(x)(x−a)n⟶0(x→a). Equivalently, in the usual little-o shorthand, f(x)=Tn,af(x)+o((x−a)n). For n=0, the analogous assertion is the separate continuity condition at a: for every ε>0, all domain points x sufficiently near a satisfy ∣f(x)−f(a)∣<ε.

Facts & Assumptions

Given: The stated differentiability on the open neighbourhood Nδ(a) of The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, or the separate continuity hypothesis when n=0.

[L2]

The derivative quotient is The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set, differentiability implies continuity (A function differentiable at c is continuous at c), and continuity at a has the stated quantified condition (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point). The Cauchy quotient lemma is Cauchy's mean-value theorem in quotient form when the denominator derivative is nonzero, the shifted-power derivative follows from For a natural n≥1 the function x↦xn is differentiable everywhere with derivative ι(n) x n−1; for n=0 it is the constant 1, with derivative 0; for a natural n≥1 the function x↦x−n is differentiable at every x≠0 with derivative −ι(n) x−n−1; consequently every polynomial function is differentiable at every real, with the derivative computed term by term and The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c), and finite limits are The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A and obey Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero.

[L3]

For n≥1, the canonical real ι(n) is positive and hence nonzero (The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing).

Proof

technique · induction
1.1

Under the separate n=0 hypothesis, the quantified assertion is exactly the definition of continuity at a.

givenL2
1.2

For n=1, the derivative definition gives f(x)−f(a)−f′(a)(x−a)x−a=f(x)−f(a)x−a−f′(a)⟶0. This is the required base case.

basegivenL2
1.3

Assume n≥2 and the assertion through order n−1. Put R=Rn,af. Then R(a)=R′(a)=0, and R′(x)=Rn−1,a(f′)(x).

L1algebra
2.1

By the induction hypothesis applied to f′, R′(x)/(x−a)n−1→0. Applying the Cauchy quotient lemma to R(x)−R(a) and (x−a)n gives R(x)/(x−a)n=R′(ξ)/(ι(n)(ξ−a)n−1) for a point ξ between a and x.

step 1.3ihL2L3
3.1

Since ξ→a, the right side tends to 0. This proves the Peano estimate without assuming continuity of f(n).

step 2.1L2discharge-induction∎
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

A uniform derivative bound gives a uniform Taylor remainder bound

Statement

Let n∈N, and suppose f has derivatives through order n+1 on the closed interval between a and x, with the usual endpoint continuity. If ∣f(n+1)(t)∣≤M throughout that interval, then ∣Rn,af(x)∣≤Mι((n+1)!)∣x−a∣n+1.

Facts & Assumptions

Proof

technique · direct
1.1

If x=a, then Rn,af(a)=0, so the estimate is immediate. If x≠a, [L1] gives Rn,af(x)=f(n+1)(ξ)ι((n+1)!)(x−a)n+1 for some point ξ strictly between a and x.

L1
2.1

In the case x≠a, take absolute values in step 1.1, use ∣f(n+1)(ξ)∣≤M, and divide by the positive factorial. Together with the case x=a, this proves the estimate.

step 1.1L2algebra∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

The second-derivative test for strict local extrema

Statement

Suppose f′(c)=0 and f′′ exists and is continuous near c. If f′′(c)>0, then c is a strict local minimum; if f′′(c)<0, then c is a strict local maximum.

Facts & Assumptions

Proof

technique · cases
1.1

If f′′(c)>0, [L1] gives an interval about c on which f′′>0. Hence f′ is strictly increasing there; since f′(c)=0, f′<0 to the left and f′>0 to the right.

assume-case positiveL1L2
1.2

If f′′(c)<0, apply the preceding argument to −f; this gives a strict local maximum.

assume-case negativeL1L2
2.1

Applying [L2] to f, it decreases toward c from the left and increases away from c on the right, so c is a strict local minimum.

step 1.1L2
3.1

The two stated sign cases are exhausted.

step 2.1step 1.2cases-exhaustive∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01Open item page →

The first nonzero higher derivative classifies a stationary point

Statement

Let n≥2, and suppose there is a real δ>0 such that f is n-times differentiable on the open interval Nδ(c)=(c−δ,c+δ). Suppose f(j)(c)=0 for 1≤j<n, while f(n)(c)≠0. If n is even, c is a strict local minimum when f(n)(c)>0 and a strict local maximum when it is negative. If n is odd, c is not a local extremum and f(x)−f(c) changes sign at c.

Facts & Assumptions

Proof

technique · cases
1.1

Peano's formula gives f(x)−f(c)=(x−c)n(f(n)(c)/ι(n!)+ε(x)), where ε(x)→0. The parenthesized factor has the sign of f(n)(c) near c.

L1L2L3
2.1

If n is even, (x−c)n>0 for x≠c, so the difference has one strict sign on both sides, giving the asserted minimum or maximum.

assume-case evenstep 1.1L2
2.2

If n is odd, (x−c)n has opposite signs on the two sides, so the difference changes sign and no local extremum occurs.

assume-case oddstep 1.1L2
3.1

Every natural n≥1 is even or odd, so the cases are exhaustive.

step 2.1step 2.2cases-exhaustive∎
RemarkRemark: AI-generatedProof: Not applicableverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

Scope, endpoint, factorial, and deferred-remainder conventions

Remarks

Higher derivatives are the recursive objects of Higher derivatives and the classes Ck and C∞. Darboux's theorem (Darboux's theorem: every derivative has the intermediate-value property) concerns every first derivative, without assuming that derivative continuous. The two L'Hôpital theorems, L'Hôpital's rule for the 0/0 form at finite or infinite, one-sided endpoints and L'Hôpital's rule for the ∞/∞ form at finite or infinite, one-sided endpoints, require their stated derivative and nonvanishing hypotheses and do not assert converses.

Endpoint derivatives and finite-endpoint limits are one-sided when the domain supplies only one side. Natural factorials and binomial coefficients (The factorial n! and the falling factorial nk‾, defined by recursion in N, The set [A]k of k-element subsets and the binomial coefficient (nk):=∣[n]k∣) enter real formulas through the canonical embedding ι of The canonical natural ι(n)=n⋅1F of a field. Darboux's property alone has no general continuity converse; the page's An injective or monotone derivative on an interval is continuous proves continuity under the stated injectivity or monotonicity hypotheses.

The Schlömilch-Roche formula (Taylor's Schlömilch–Roche remainder formula) assumes an (n+1)-st derivative on an interval. Peano's formula (Peano's form: the normalized Taylor remainder tends to zero) assumes n-fold differentiability on an open interval Nδ(a) around the expansion point (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R), but not continuity of the n-th derivative. No integral remainder, Borel interpolation theorem, or assertion about Dini derivatives is made here.

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-01Open item page →

If f′(a)=f′′(a)=0, then the second derivative test still decides whether a is an extremum

Statement

False claim: If f′(c)=f′′(c)=0, then the value of f′′(c) decides whether c is a local minimum, a local maximum, or neither.

Facts & Assumptions

Given: The functions f+(x)=x4, f−(x)=−x4, and f0(x)=x3 at c=0.

[L1]

The second derivative test is silent when f′′(c)=0 (The second-derivative test for strict local extrema).

[L2]

The first nonzero derivative test classifies the three functions by their first nonzero derivatives (The first nonzero higher derivative classifies a stationary point).

Refutation

technique · direct
1.1

Direct differentiation gives f±′(0)=f0′(0)=0 and f±′′(0)=f0′′(0)=0.

givenalgebra
1.2

Yet x4≥0 with equality only at 0, so f+ has a strict minimum; −x4≤0, so f− has a strict maximum; and x3 changes sign, so f0 has neither.

givenL2algebra
2.1

The identical second-derivative data lead to all three outcomes, refuting the claim.

step 1.1step 1.2L1∎

Sources