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

The continued fraction [1; overline 2] for sqrt(2)

Example

The continued fraction of 2 is 2=[1;2], with convergents 1,32,75,1712,.

Facts & Assumptions

Given: The real number 2.

[F1]

Consecutive convergents satisfy pnqn1pn1qn=(1)n1 (Determinant identity for consecutive convergents).

[F2]

For an irrational number α, the convergents alternate around α and satisfy αpn/qn<1/(qnqn+1) (Convergent error bound).

[F3]

The complete-quotient algorithm chooses the unique integer part and then takes the reciprocal of the positive fractional part (Complete quotients in the continued-fraction algorithm).

[F4]

If the complete-quotient algorithm does not terminate, its resulting infinite regular continued fraction converges to the original real number (The continued-fraction algorithm for real numbers).

[F5]

For digits an, the convergent numerators and denominators start from p2=0,p1=1,q2=1,q1=0 and satisfy pn=anpn1+pn2 and qn=anqn1+qn2 (Convergents of a regular continued fraction).

Verification

technique · direct
1.1

Since 1<2<2, [F3] gives a0=1. Then [F3, F4, given, algebra] α1=121=2+1, so 2<α1<3 and a1=2. Moreover 1α12=121=α1, so every later complete quotient is again α1. Thus the algorithm never terminates and produces the digits 1,2,2,; by [F4] its continued fraction converges to the original number. Hence 2=[1;2].

F3F4givenalgebra
2.1

Applying [F5] to the digits from step 1.1 gives [F5, step 1.1, algebra] (p0,q0)=(1,1),(p1,q1)=(3,2),(p2,q2)=(7,5),(p3,q3)=(17,12), so the convergents begin 1,32,75,1712. The same recurrence gives q4=29. For the displayed pairs one checks 3112=1,7235=1,175712=1, exactly as [F1] predicts.

F1F5step 1.1algebra
3.1

The error formula [F2] now gives [F2, step 2.1, algebra] 232=3222<110,275=5275<160, and similarly 21712=1712212<1348. So the concrete convergents alternate around 2 with the expected quality of approximation.

F2step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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