False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16

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.

FALSE: The recurrence coefficients alone determine the sequence

Statement

False claim. The coefficients of a constant-coefficient linear recurrence determine its sequence without any initial values.

Facts & Assumptions

Given: The recurrence $a_{n + 2} = a_{n + 1} + a_{n}$ .

[L1]

For a fixed order- $d$ recurrence, every choice of $d$ initial values determines exactly one recurrence sequence ( $d$ initial values determine a sequence satisfying a fixed order- $d$ recurrence).

Refutation

technique · two initial-value witnesses

1.1givenalgebra

With initial pair $(a_{0}, a_{1}) = (0, 0)$ , the recurrence gives the zero sequence. With initial pair $(b_{0}, b_{1}) = (0, 1)$ , it gives $0, 1, 1, 2, 3, \dots$ .

2.1step 1.1L1∎

The two sequences obey exactly the same recurrence coefficients but differ at index one. This is consistent with [L1], which requires the two initial values in addition to the coefficients, and it refutes the claim.

Depends on

$d$ initial values determine a sequence satisfying a fixed order-$d$ recurrence

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

2 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

R. P. Stanley, Enumerative Combinatorics, vol. 1, 2nd ed., Sections 4.1-4.2 (standard reference, not scraped)