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.
Schwartz zippel for a bivariate polynomial
Example
For the nonzero formal polynomial over , total degree is two. Of the 25 independent uniform pairs, precisely are roots. The actual zero probability is , strictly below the Schwartz–Zippel bound .
Facts & Assumptions
Given: Independent uniform X,Y in the five-element residue field.
A nonzero total-degree-d polynomial on a nonempty uniform product set A has zero probability at most (Schwartz zippel over finite fields).
Residues modulo a prime form a field (For every prime , the two operations on make it a field).
Verification
Five has no positive proper divisors other than one: 2,3,4 leave remainders 1,2,1. Thus F2 supplies , with distinct residues 0 through 4. At X=0, . At each nonzero X, the unique Y solving is its inverse: , , , modulo 5. Cancellation rules out any additional Y for the same X. These are all five possibilities for X, so exactly the four listed pairs are roots.
Each pair has mass , so the count gives probability . The formal coefficient of XY is one and its total degree is two; the constant term is nonzero but has degree zero, so it does not change total degree. F1 with m=2, d=2 and A equal to the field gives . Consequently . The comparison is an upper bound, not a claimed equality; independence is used to give every pair the same mass.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- Local example of Arora–Barak Appendix A Lemma A.25 (standard reference, not scraped)