Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-02
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.

T0 through T4 and U0 through U3 from the Chebyshev recurrences

Example

The recurrences give T0=1, T1=x, T2=2x2−1, T3=4x3−3x, T4=8x4−8x2+1, and U0=1, U1=2x, U2=4x2−1, U3=8x3−4x. The conventions and prerequisite facts used below are recorded in Chebyshev polynomials of the first and second kinds by their three-term recurrences, Degrees and leading coefficients of the Chebyshev polynomials.

Facts & Assumptions

Given: The defining recurrences.

Verification

1.1

Apply the Tn recurrence successively and collect like powers through T4.

algebra
2.1

Apply the Un recurrence successively and collect like powers through U3.

algebra∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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