Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-06 (claude-sonnet-5)
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 sequence 1,1,2,1,3,1,4,1, 1, 2, 1, 3, 1, 4, \dots is unbounded and has a convergent subsequence

Statement refuted

Refuted claim: a sequence of reals with a convergent subsequence is bounded, which is the converse of Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence (FALSE: a sequence with a convergent subsequence is bounded (the converse of Bolzano-Weierstrass), Sequences of reals: bounded, eventually, frequently, tails, subsequences).

The witness is the interleaving

1,  1,  2,  1,  3,  1,  4,  1,\; 1,\; 2,\; 1,\; 3,\; 1,\; 4,\; \dots

whose terms at even indices are 1,2,3,1, 2, 3, \dots and whose terms at odd indices are all 11. It is unbounded, and its odd-indexed subsequence is constant, hence convergent. The refutation is carried out in full in FALSE: a sequence with a convergent subsequence is bounded (the converse of Bolzano-Weierstrass); this item records the witness and adds the computation of its subsequential limit set.

Facts & Assumptions

[L1]

The witness: (yn)(y_n) is well defined, the subsequence (yoj)(y_{o_j}) is constantly 11 and converges to 11, and (yn)(y_n) is unbounded (FALSE: a sequence with a convergent subsequence is bounded (the converse of Bolzano-Weierstrass)).

[L3]

Canonical naturals: positive for m1m \ge 1 and strictly increasing in the index (Canonical naturals are positive and strictly increasing); the Archimedean property (Every complete ordered field is Archimedean).

[L4]

Boundedness of a sequence and of a subset of R\mathbb{R} (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Lower bound, bounded below, bounded set); a constant sequence converges to its value (Limits and Cauchy sequences of reals); and every convergent sequence of reals is bounded (Every convergent sequence is bounded).

[L6]

Absolute value: t=t|t| = t for t0t \ge 0 (Basic properties of the absolute value); trichotomy of the order (Complete ordered field (least-upper-bound property), Ordered field).

[L7]

Bolzano-Weierstrass: every bounded sequence of reals has a convergent subsequence (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence).

[L8]

The refuted claim: a sequence of reals with a convergent subsequence is bounded.

Counterexample

technique · direct
1.1

(yn)(y_n) has a convergent subsequence, namely the constant subsequence along oo, which converges to 11; so it satisfies the hypothesis of the claim.

givenL1L2L4L5L8
1.2

(yn)(y_n) is unbounded: no real MM satisfies ynM|y_n| \le M at every index.

givenL1L3L4L6
2.1

The claim is therefore refuted: a convergent subsequence does not force boundedness, and the converse of Bolzano-Weierstrass fails.

step 1.1step 1.2L7L8
3.1

The subsequential limit set of (yn)(y_n) is exactly {1}\{1\}. It contains 11 by step 1.1. Conversely, let (yni)(y_{n_i}) converge; a convergent sequence is bounded, and along the even indices the values yej=j+1y_{e_j} = j+1 exceed every bound, so only finitely many nin_i can lie in the range of ee; all later nin_i lie in the range of oo, where the value is 11, so the subsequence is eventually constantly 11 and its limit is 11.

step 1.1step 1.2L2L3L4L5

Remarks

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: 64 results over 25 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.

Sources