Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-10 (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.

FALSE: a sequence in Rn\mathbb{R}^{n} whose coordinate sequences are each bounded converges

Statement

False claim: let n1n \ge 1 and let (x(k))\bigl(x^{(k)}\bigr) be a sequence in Rn\mathbb{R}^{n} such that every coordinate sequence kxj(k)k \mapsto x^{(k)}_j (j<n)(j<n) is bounded (Sequences of reals: bounded, eventually, frequently, tails, subsequences). Then (x(k))\bigl(x^{(k)}\bigr) converges in (Rn,d2)(\mathbb{R}^{n}, d_2) (Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}, Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it).

The claim conflates two theorems. What is true about boundedness is For n1n \ge 1 every bounded sequence in Rn\mathbb{R}^n has a convergent subsequence: a bounded sequence has a convergent subsequence. What is true componentwise is For n1n \ge 1 a sequence in Rn\mathbb{R}^n converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and Rn\mathbb{R}^n is complete in every norm clause 1, which is about convergence of the coordinate sequences and says nothing about boundedness. The false claim takes the hypothesis of the first and the conclusion of the second.

The witness is the smallest possible. Take n=1n = 1 and let x(k)R1x^{(k)} \in \mathbb{R}^{1} be the function 1R1 \to \mathbb{R} with value εk\varepsilon_k at 00, where (εk)(\varepsilon_k) is the alternating sequence (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).

Facts & Assumptions

Given: The alternating sequence (εk)(\varepsilon_k), with ε0=1\varepsilon_0 = 1, εk+1=εk\varepsilon_{k+1} = -\varepsilon_k and εk=1|\varepsilon_k| = 1; its even and odd index maps ee and oo, strictly increasing with εel=1\varepsilon_{e_l} = 1 and εol=1\varepsilon_{o_l} = -1 for every ll (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); and the sequence x(k)R1x^{(k)} \in \mathbb{R}^{1} with x0(k)=εkx^{(k)}_0 = \varepsilon_k.

[A1]

The refuted claim, at n=1n = 1 and this sequence: (x(k))\bigl(x^{(k)}\bigr) converges in (R1,d2)(\mathbb{R}^{1},d_2).

[L3]

A subsequence of a convergent real sequence converges to the same limit, and a real sequence has at most one limit (Subsequences inherit the limit, A sequence has at most one limit, Limits and Cauchy sequences of reals).

[L4]

A constant real sequence converges to its value (Limits and Cauchy sequences of reals).

[L5]

111 \ne -1, since 1(1)=ι(2)>01-(-1) = \iota(2) > 0 (Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

Refutation

technique · direct
1.1

The only coordinate sequence of (x(k))\bigl(x^{(k)}\bigr) is kεkk \mapsto \varepsilon_k, and it is bounded: εk=1|\varepsilon_k| = 1 for every kk, so M=1M = 1 works. So the hypothesis of the refuted claim is met.

L1
1.2

The subsequence lεell \mapsto \varepsilon_{e_l} is constantly 11 and converges to 11; the subsequence lεoll \mapsto \varepsilon_{o_l} is constantly 1-1 and converges to 1-1; both index maps are strictly increasing.

L1L4
2.1

The real sequence (εk)(\varepsilon_k) does not converge: if it converged to LL, both subsequences of step 1.2 would converge to LL, so L=1L = 1 and L=1L = -1 by uniqueness of limits, contradicting 111 \ne -1.

step 1.2L3L5
3.1

By the componentwise criterion, (x(k))\bigl(x^{(k)}\bigr) converges in (R1,d2)(\mathbb{R}^{1},d_2) if and only if (εk)(\varepsilon_k) converges in R\mathbb{R}; by step 2.1 it does not. So [A1] fails while the hypothesis holds, and the claim is false.

step 1.1step 2.1A1L2
4.1

The true statement in this neighbourhood is that the sequence has a convergent subsequence: its range is bounded, so [L6] applies, and step 1.2 exhibits two convergent subsequences with different limits.

step 1.1step 1.2L6

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: 218 results over 36 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