Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 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.

A recurrence over Q can require a proper splitting field for its exponential closed form

Statement refuted

Every constant-coefficient recurrence over Q has its characteristic-root exponential closed form over Q, without passing to a proper splitting field.

Facts & Assumptions

Given: The sequence defined by a0=0, a1=1, and an+2+an=0.

[L1]

A recurrence beginning at zero is represented by its rational formal generating function (A coefficient sequence is eventually linearly recurrent if and only if its formal generating function is rational).

[L2]

The polynomial-times-exponential form is asserted over a named splitting field of the recurrence characteristic polynomial (Over a named splitting field in characteristic zero, repeated characteristic roots give polynomial-times-exponential closed forms).

Counterexample

technique · explicit splitting field
1.1

Multiplying A(x)=n0anxn by 1+x2 and using the recurrence leaves x, so [L1] gives A(x)=x/(1+x2) over Q.

givenL1algebra
1.2

The characteristic polynomial t2+1 has no root in Q, but in Q(i) it factors as (ti)(t+i). Thus a pure-exponential expression using its characteristic roots cannot be written with bases in Q.

algebra
2.1

Applying [L2] in the splitting field and matching a0=0,a1=1 gives an=(in(i)n)/(2i). Its first four values are 0,1,0,1, which satisfy the given recurrence.

step 1.2L2algebra
3.1

This rational recurrence over Q therefore requires the proper splitting field Q(i) for its characteristic-root exponential form, refuting the claim.

step 1.1step 1.2step 2.1

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: 49 results over 9 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.