CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11

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.

Over $\mathbb F_p$ , $x^p-x$ and the zero polynomial induce the same function but are distinct polynomials

Statement refuted

Two formal polynomials over a field are equal whenever they induce the same function on that field.

Facts & Assumptions

Given: A prime $p$ , the field $\mathbb F_p=\mathbb Z/p$ , and the polynomials $f=x^p-x$ and $0$ in $\mathbb F_p[x]$ .

[L1]

Evaluation substitutes an element into a formal polynomial, while the formal polynomial itself is its coefficient sequence (Evaluation and roots of a polynomial in a commutative target ring).

[L2]

Fermat's little theorem gives $a^p\equiv a\pmod p$ for every integer $a$ (Fermat's little theorem: for prime $p$ , $p\nmid a$ implies $a^{p-1}\equiv1\pmod p$ , and always $a^p\equiv a\pmod p$ ).

[L3]

The ring $\mathbb Z/p$ is the quotient $\mathbb Z/p\mathbb Z$ (For every $n\in\mathbb N$ , the congruence-class ring $\mathbb Z/n$ is the quotient ring $\mathbb Z/n\mathbb Z$ ).

[L4]

A prime integer is greater than $1$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ).

[L5]

For prime $p$ , the quotient ring $\mathbb Z/p$ is a field (For every prime $p$ , the two operations on $\mathbb{Z}/p$ make it a field).

Counterexample

technique · direct

1.1

Fact [L5] licenses the field $\mathbb F_p=\mathbb Z/p$ . For every $a\in\mathbb F_p$ , choose an integer representative; [L2] and [L3] give $f(a)=a^p-a=0$ , so $f$ and the zero polynomial induce the same function.

givenL1L2L3L5

2.1

Because [L4] gives $p>1$ , the degrees $p$ and $1$ are distinct; as a coefficient sequence, $f$ has coefficient $1$ in degree $p$ and is therefore nonzero. Hence [L1] distinguishes $f$ from the zero formal polynomial and refutes the statement.

givenL1L3L4∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 94 results over 24 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources

Neil Donaldson, Math 120B Notes, Section 22, polynomial functions (standard reference, not scraped)

Over Fp\mathbb F_pFp​, xp−xx^p-xxp−x and the zero polynomial induce the same function but are distinct polynomials