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.
Positive endpoint samples do not ensure a positive interpolant
Example
The quadratic is positive at both sampled endpoints but negative at . Its degree-two Bernstein controls are ; the negative middle control explains why the all-controls-nonnegative hypothesis in Bernstein control values bound a piecewise polynomial does not apply.
Facts & Assumptions
Given: The interval , the polynomial , and exact real arithmetic.
Piecewise Bernstein representation: a degree-two Bernstein polynomial has the form .
Bernstein control values bound a piecewise polynomial: nonnegative Bernstein controls suffice for nonnegativity throughout the interval.
The set of -element subsets and the binomial coefficient : for every natural .
The canonical natural of a field: the canonical embedding sends zero to zero and each successor to the previous image plus one.
Verification
By [F3], ; applying the recursion in [F4] twice shows its canonical real value is . Expanding gives , so [F1] identifies its Bernstein controls as , , .
Direct substitution gives , while . Thus positive samples at the two endpoints do not control the interpolant between them.
The middle Bernstein control is negative, so the sufficient hypothesis in [F2] is absent; the negative value in step 1.2 is consistent with the control-hull theorem.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
24 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.