Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

Cauchy's mean value theorem: for f,g continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with (f(b)−f(a))g′(c)=(g(b)−g(a))f′(c); no hypothesis on g′ is needed in this product form

Statement

Let a,b∈R with a<b and let f,g:[a,b]→R be continuous on [a,b] (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, Intervals of R: the nine order-convex forms, nondegeneracy, and length) and differentiable at every point of (a,b) as functions on [a,b] (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). Then there is c∈(a,b) with

(f(b)−f(a)) g′(c)  =  (g(b)−g(a)) f′(c).

The statement is a product identity, and that is deliberate. The familiar quotient form

f(b)−f(a)g(b)−g(a)  =  f′(c)g′(c)

is not asserted here, and it is not equivalent: its left side needs g(b)≠g(a) and its right side needs g′(c)≠0, and neither follows from the hypotheses. The product form above needs neither, holds under exactly the hypotheses stated, and specialises to the quotient form whenever both denominators happen to be nonzero. The companion page exhibits an f and a g for which the quotient form is meaningless while the product form holds.

Facts & Assumptions

Given: Reals a<b and functions f,g:[a,b]→R, both continuous on [a,b] and both differentiable at every point of (a,b).

[L1]

Rolle's theorem (Rolle's theorem: if a<b, f is continuous on [a,b], differentiable at every point of (a,b), and f(a)=f(b), then f′(c)=0 for some c∈(a,b)): a function continuous on [a,b], differentiable at every point of (a,b) and taking equal values at a and at b has a vanishing derivative at some point of (a,b).

[L3]

Algebra of derivatives (Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0, claims 1 and 2): at a limit point of the common domain, a sum of functions differentiable there is differentiable with the sum of the derivatives, and a scalar multiple with the scalar multiple of the derivative.

Proof

technique · direct
1.1

Put λ:=f(b)−f(a) and μ:=g(b)−g(a), two reals, and define h:[a,b]→R by h(x):=λ g(x)−μ f(x).

construct
2.1

h is continuous on [a,b], being the sum of the scalar multiples λg and (−μ)f of two functions continuous on [a,b].

step 1.1L2
2.2

h is differentiable at every c∈(a,b) with h′(c)=λ g′(c)−μ f′(c): such a c is a limit point of [a,b] by [L4], and f and g are differentiable there, so the scalar-multiple and sum rules of [L3] apply on the domain [a,b].

step 1.1L3L4
2.3

h(a)=h(b). Expanding, h(a)=(f(b)−f(a))g(a)−(g(b)−g(a))f(a)=f(b)g(a)−f(a)g(a)−g(b)f(a)+g(a)f(a)=f(b)g(a)−g(b)f(a), and h(b)=(f(b)−f(a))g(b)−(g(b)−g(a))f(b)=f(b)g(b)−f(a)g(b)−g(b)f(b)+g(a)f(b)=g(a)f(b)−f(a)g(b). The two expressions are the same.

step 1.1algebra
3.1

By steps 2.1, 2.2 and 2.3 the function h satisfies every hypothesis of [L1], so there is c∈(a,b) with h′(c)=0, that is λ g′(c)−μ f′(c)=0, that is (f(b)−f(a))g′(c)=(g(b)−g(a))f′(c).

step 2.1step 2.2step 2.3L1∎

Remarks

Depends on

Used by

Dependency tree · two levels

33 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