Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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 whose coordinate sequences are each bounded converges

Statement

False claim: let n≥1 and let (x(k)) be a sequence in Rn such that every coordinate sequence k↦xj(k) (j<n) is bounded (Sequences of reals: bounded, eventually, frequently, tails, subsequences). Then (x(k)) converges in (Rn,d2) (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

The claim conflates two theorems. What is true about boundedness is For n≥1 every bounded sequence in Rn has a convergent subsequence: a bounded sequence has a convergent subsequence. What is true componentwise is For n≥1 a sequence in Rn converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and Rn 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=1 and let x(k)∈R1 be the function 1→R with value εk at 0, where (εk) is the alternating sequence (The even and odd index maps and the alternating sequence: strictly increasing e,o with N their disjoint union, and the unique (sk) with s0=1, sσ(k)=−sk, which satisfies ∣sk∣=1, s∘e≡1 and s∘o≡−1).

Facts & Assumptions

Given: The alternating sequence (εk), with ε0=1, εk+1=−εk and ∣εk∣=1; its even and odd index maps e and o, strictly increasing with εel=1 and εol=−1 for every l (The even and odd index maps and the alternating sequence: strictly increasing e,o with N their disjoint union, and the unique (sk) with s0=1, sσ(k)=−sk, which satisfies ∣sk∣=1, s∘e≡1 and s∘o≡−1); and the sequence x(k)∈R1 with x0(k)=εk.

[A1]

The refuted claim, at n=1 and this sequence: (x(k)) converges in (R1,d2).

[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).

Refutation

technique · direct
1.1

The only coordinate sequence of (x(k)) is k↦εk, and it is bounded: ∣εk∣=1 for every k, so M=1 works. So the hypothesis of the refuted claim is met.

L1
1.2

The subsequence l↦εel is constantly 1 and converges to 1; the subsequence l↦εol is constantly −1 and converges to −1; both index maps are strictly increasing.

L1L4
2.1

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

step 1.2L3L5
3.1

By the componentwise criterion, (x(k)) converges in (R1,d2) if and only if (εk) converges in 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 · two levels

119 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