Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-08 (gpt-5.6-terra-codex-subscription)
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 sequence with lim sup=+\limsup = +\infty: the greatest subsequential limit exists only in R\overline{\mathbb{R}}

Statement refuted

That The limit superior is itself a subsequential limit in R\overline{\mathbb{R}} and is the greatest one can be stated inside R\mathbb{R}: that for every sequence (xk)(x_k) of reals the set SL(x)\operatorname{SL}(x) of real subsequential limits (Subsequential limit of a real sequence, and the subsequential limit set) has a greatest element and that element is lim supkxk\limsup_k x_k.

The witness below has a nonempty SL(x)\operatorname{SL}(x) with a greatest element, so the failure is not that the real set is empty: it is that the greatest element of SL(x)\operatorname{SL}(x) is 00 while lim supkxk=+\limsup_k x_k = +\infty. The dominant behaviour of the sequence is invisible to SL(x)\operatorname{SL}(x) and is recorded only by SL(x)\overline{\operatorname{SL}}(x) (Convergence in R\overline{\mathbb{R}} and the extended subsequential limit set: LRL \in \overline{\mathbb{R}} is an extended subsequential limit when some subsequence converges to LL, or diverges to L=±L = \pm\infty).

Facts & Assumptions

Given: The alternating sequence (sk)(s_k) and the index maps e,oe, o of The even and odd index maps and the alternating sequence: strictly increasing e,oe, o with N\mathbb{N} their disjoint union, and the unique (sk)(s_k) with s0=1s_0 = 1, sσ(k)=sks_{\sigma(k)} = -s_k, which satisfies sk=1|s_k| = 1, se1s \circ e \equiv 1 and so1s \circ o \equiv -1; the canonical naturals ι(k)=k1R\iota(k) = k \cdot 1_{\mathbb{R}} with ι(0)=0\iota(0) = 0; and the sequence xk:=ι(k)x_k := \iota(k) when sk=1s_k = 1 and xk:=0x_k := 0 when sk=1s_k = -1.

[L3]

The order on R\overline{\mathbb{R}} is total, ++\infty is greatest, every real is <+< +\infty and >> -\infty, and the order restricts on R\mathbb{R} to the order of R\mathbb{R} (The extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}, its order, and the arithmetic that is left undefined).

[L5]

Canonical naturals: ι\iota is strictly increasing with ι(k)0\iota(k) \ge 0, and for every real MM there is a natural p1p \ge 1 with M<ι(p)M < \iota(p) (Canonical naturals are positive and strictly increasing, Every complete ordered field is Archimedean).

[L6]

A convergent sequence of reals is bounded, a limit is unique, and a sequence agreeing with a constant from some index on converges to that constant (Every convergent sequence is bounded, A sequence has at most one limit, Convergence depends only on the tail, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Counterexample

technique · direct
1.1

Each sks_k is 11 or 1-1, so (xk)(x_k) is a well-defined sequence of reals with xk0x_k \ge 0 for every kk; moreover xej=ι(ej)x_{e_j} = \iota(e_j) and xoj=0x_{o_j} = 0 for every jj.

givenL1L5L7
1.2

The subsequence along oo is constantly 00, and oo is strictly increasing, so 0SL(x)0 \in \operatorname{SL}(x).

givenL1L4L6
2.1

For every nNn \in \mathbb{N} the tail supremum supTn(x)\sup T_n(x) is ++\infty. Given a real MM, take a natural p1p \ge 1 with M<ι(p)M < \iota(p) and an index jj at least as large as both nn and pp; then ejjne_j \ge j \ge n, so xej=ι(ej)Tn(x)x_{e_j} = \iota(e_j) \in T_n(x), and ejjpe_j \ge j \ge p gives ι(ej)ι(p)>M\iota(e_j) \ge \iota(p) > M. So no real number bounds Tn(x)T_n(x) above, and the least upper bound in R\overline{\mathbb{R}} must be ++\infty.

step 1.1L1L2L3L5L7
3.1

Every real subsequential limit of (xk)(x_k) equals 00. Let nn be strictly increasing with xniLRx_{n_i} \to L \in \mathbb{R}; the subsequence is then bounded, say xniB|x_{n_i}| \le B for every ii. Suppose sni=1s_{n_i} = 1 for arbitrarily large ii: taking a natural p1p \ge 1 with B<ι(p)B < \iota(p) and such an index ipi \ge p, we get xni=ι(ni)ι(i)ι(p)>Bx_{n_i} = \iota(n_i) \ge \iota(i) \ge \iota(p) > B, contradicting the bound. So there is II with sni=1s_{n_i} = -1, hence xni=0x_{n_i} = 0, for every iIi \ge I; a sequence equal to 00 from an index on converges to 00, so L=0L = 0 by uniqueness of limits.

step 1.1step 2.1L1L4L5L6L7
4.1

Consequently lim supkxk\limsup_k x_k is the greatest lower bound of the family {+}\{+\infty\}, namely ++\infty, while SL(x)={0}\operatorname{SL}(x) = \{0\} by steps 1.2 and 3.1, whose greatest element is the real number 00. Since 0+0 \ne +\infty, the refuted claim fails for this sequence.

step 2.1step 1.2step 3.1L2L3

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: 85 results over 31 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