Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

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

Statement

Powers are those of Integer powers am, and ι:N→R is the canonical natural of The canonical natural ι(n)=n⋅1F of a field, so that ι(0)=0 and ι(m+1)=ι(m)+1. Let n∈N.

  1. The function p0:R→R, p0(x)=x0, is the constant function 1, and it is differentiable at every c∈R with p0′(c)=0 (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).
  2. For n≥1 the function pn:R→R, pn(x)=xn, is differentiable at every c∈R, and pn′(c)  =  ι(n) c n−1.
  3. For n≥1 put A0:={ x∈R:x≠0 }. The function mn:A0→R, mn(x)=x−n, is differentiable at every c∈A0 as a function on A0, and mn′(c)  =  − ι(n) c −n−1.
  4. Let a:N→R with aj=0 for j≥n, and let P:R→R be the polynomial function P(x)=∑j<najxj (Finite sums and finite products, by recursion). Then P is differentiable at every c∈R, and, defining e:N→R by e0:=0 and ej:=ι(j) aj c j−1 for j≥1, P′(c)  =  ∑j<nej.

Claim 2 is stated for n≥1 and not for n≥0, and that is not timidity. At n=0 its right-hand side reads ι(0) c−1, and c−1 is not defined at c=0 (Integer powers am), so the formula is not a statement about the whole line. Claim 1 is what covers n=0, and it says the derivative is 0 there, which is what the informal reading "0⋅c−1" is reaching for. The same shift is why the term e0 of claim 4 is defined to be 0 outright rather than by the formula.

Facts & Assumptions

Given: A natural n, a real c, and the functions pn, mn and P of the statement.

[L1]

Powers (Integer powers am): a0=1 and am+1=ama for every a∈R and m∈N; a−m:=(am)−1 for a≠0 and m≥1; and 0m=0 for m≥1.

[L2]

Canonical naturals (The canonical natural ι(n)=n⋅1F of a field): ι(0)=0, ι(m+1)=ι(m)+1, and hence ι(1)=1.

[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): at a limit point c of the common domain, sums, scalar multiples and products of functions differentiable at c are differentiable at c with the four stated formulas, and if the denominator is nonzero at c then the quotient, restricted to the set where the denominator does not vanish, is differentiable at c with the quotient formula; that restricted set has c as a limit point.

[L4]

Derivative and difference quotient (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): f is differentiable at a limit point c of its domain D exactly when the difference quotient x↦(f(x)−f(c))/(x−c), a function on D∖{c}, has a limit at c, and f′(c) is that limit. A constant function h≡K on a set having c as a limit point has lim⁡x→ch(x)=K: given a real ε>0, any real δ>0 serves, since ∣K−K∣=0<ε (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A).

[L5]

Induction principle on N (The principle of mathematical induction).

[L6]

Finite sums (Finite sums and finite products, by recursion): ∑j<0bj=0 and ∑j<m+1bj=(∑j<mbj)+bm.

[L7]

Integer exponent laws for a nonzero base (Laws of integer exponents): ak≠0 for every k∈N when a≠0; and for integers j,k one has ajak=aj+k, (aj)k=ajk and a−k=(ak)−1.

Proof

technique · induction
1.1

Base case, claim 2 at n=1. By [L1], x1=x0x=1⋅x=x, so p1 is the identity. Fix c∈R; for every x≠c the difference quotient is (x−c)/(x−c)=1, so it is the constant function 1 on R∖{c}, and by [L4] and [L8] its limit at c is 1. Since ι(1)c0=1⋅1=1 by [L1] and [L2], claim 2 holds at n=1.

baseL1L2L4L8
1.2

Inductive hypothesis. Fix a natural n≥1 and assume that pn is differentiable at every c∈R with pn′(c)=ι(n)c n−1.

ih
1.3

Claim 1. By [L1] the function p0 is the constant function 1. Fix c∈R; for every x≠c its difference quotient is (1−1)/(x−c)=0, the constant function 0 on R∖{c}, whose limit at c is 0 by [L4] and [L8]. So p0 is differentiable at every c with p0′(c)=0.

L1L4L8
2.1

Successor step. Let c∈R. By [L1], pn+1(x)=xn+1=xnx=pn(x) p1(x) for every x. Both factors are differentiable at c, by step 1.2 and step 1.1, so the product rule of [L3] gives that pn+1 is differentiable at c with pn+1′(c)=pn′(c)p1(c)+pn(c)p1′(c)=ι(n)c n−1c+cn⋅1. Now c n−1c=c (n−1)+1=cn by [L1], so the right-hand side is ι(n)cn+cn=(ι(n)+1)cn=ι(n+1)cn by [L2].

step 1.1step 1.2L1L2L3
3.1

Claim 2. Steps 1.1 and 2.1 are the base case and the successor step of an induction over the naturals n≥1, so by [L5] the function pn is differentiable at every c∈R with pn′(c)=ι(n)c n−1, for every natural n≥1.

step 1.1step 2.1L5
4.1

Claim 3. Let n≥1. The set { x∈R:pn(x)≠0 } is exactly A0: a nonzero x has xn≠0 by [L7], and 0n=0 by [L1]. Fix c∈A0. The constant function 1 on R is differentiable at c with derivative 0 by step 1.3, and pn is differentiable at c with derivative ι(n)c n−1 by step 3.1, with pn(c)=cn≠0. So the quotient rule of [L3] applies: the function x↦1/xn on A0, which by [L1] and [L7] is mn, is differentiable at c with derivative (0⋅cn−1⋅ι(n)c n−1)/(cn)2=−ι(n) c n−1(c 2n)−1=−ι(n) c n−1−2n=−ι(n) c −n−1, where (cn)2=c 2n and c n−1c −2n=c −n−1 are [L7].

step 1.3step 3.1L1L3L7
4.2

Claim 4, by a second induction on n. Fix c∈R and the sequence a. At n=0 the sum P(x)=∑j<0ajxj is 0 for every x by [L6], so P is the constant function 0 and, as in step 1.3, P′(c)=0=∑j<0ej. Suppose the claim holds at n, and let Pn+1(x):=∑j<n+1ajxj. By [L6], Pn+1(x)=Pn(x)+anxn for every x, where Pn(x)=∑j<najxj. The function x↦anxn is differentiable at c with derivative en: for n=0 it is the constant an, of derivative 0=e0, by step 1.3 and the scalar rule of [L3]; for n≥1 it is the scalar multiple anpn, of derivative anι(n)c n−1=en, by step 3.1 and the scalar rule of [L3]. The inductive hypothesis gives Pn′(c)=∑j<nej, so the sum rule of [L3] gives that Pn+1 is differentiable at c with Pn+1′(c)=∑j<nej+en=∑j<n+1ej by [L6]. By [L5] claim 4 holds for every n∈N.

step 1.3step 3.1L3L5L6
5.1

All four claims are established: claim 1 by step 1.3, claim 2 by step 3.1, claim 3 by step 4.1 and claim 4 by step 4.2.

step 1.3step 3.1step 4.1step 4.2discharge-induction∎

Remarks

Depends on

Used by

…and 44 more results.

Dependency tree · two levels

43 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