Alphabeta Math
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.

✓ 10 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

R^n as a Normed Space; Vector-Valued Functions: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

f(t)=(t2,t3) on [0,1]: no ξ satisfies f(1)−f(0)=f′(ξ)

Statement refuted

Refuted claim: if f:[a,b]→Rm is continuous on [a,b] and differentiable on (a,b), then there is ξ∈(a,b) with

f(b)−f(a)  =  f′(ξ) (b−a).

That is the equality form of the mean value theorem (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)), which is true for m=1 and false for m≥2. What survives is the inequality ∥f(b)−f(a)∥2≤M(b−a) of The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a), and this item is the witness showing that the inequality cannot be upgraded.

The witness. Take m=2, [a,b]=[0,1] and f:[0,1]→R2 with components f0(t)=t2 and f1(t)=t3 (Integer powers am, Vector-valued functions f:A→Rm, their limits and continuity, with the dictionary to the metric notions).

Why this curve and not the classical one. The crispest classical witness is t↦(cos⁡t,sin⁡t) on [0,2π], whose derivative has constant norm 1 while the endpoints coincide. The trigonometric functions are introduced later in the reading order than this page, so they may not be used here; the polynomial curve above carries the same refutation with the material available. This substitution is recorded here, in the item itself, so that a reader who knows the classical example is told why it is absent rather than left to suppose that this library does not know it.

Facts & Assumptions

Given: The function f:[0,1]→R2 with f0(t)=t2 and f1(t)=t3, and the reals ι(2),ι(3),ι(4),ι(13) (The canonical natural ι(n)=n⋅1F of a field).

[A1]

The refuted claim, instantiated at m=2, a=0, b=1: there is ξ∈(0,1) with f(1)−f(0)=f′(ξ)⋅(1−0), that is f(1)−f(0)=f′(ξ).

[L5]

Canonical naturals are positive and strictly increasing, and carry sums to sums and products to products, so ι(2)2=ι(4), ι(3)2=ι(9), ι(4)+ι(9)=ι(13) and ι(3)≠ι(4) (Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n⋅1F of a field).

[L6]

Squaring is strictly monotone on the nonnegatives, so square roots compare in the same direction (Squaring is monotone on the nonnegatives).

Counterexample

technique · direct
1.1

Each component is differentiable at every real, with f0′(t)=ι(2)t and f1′(t)=ι(3)t2; hence f is differentiable at every t∈[0,1] with f′(t)=(ι(2)t, ι(3)t2), and f is continuous on [0,1].

L1L2L3L7
1.2

f(1)=(1,1) and f(0)=(0,0), so f(1)−f(0)=(1,1).

given
2.1

Suppose [A1] holds and let ξ∈(0,1) be as there; comparing first coordinates gives ι(2)ξ=1, so ξ=1/ι(2).

step 1.1step 1.2A1L2
2.2

Comparing second coordinates gives ι(3)ξ2=1.

step 1.1step 1.2A1L2
3.1

Substituting ξ=1/ι(2) into step 2.2 gives ι(3)/ι(2)2=ι(3)/ι(4)=1, hence ι(3)=ι(4), contradicting the strict increase of ι.

step 2.1step 2.2L5
4.1

So no ξ∈(0,1) satisfies [A1], and the refuted claim is false for m=2.

step 2.1step 2.2step 3.1A1
5.1

The inequality form does hold on this curve, with room to spare: ∥f(1)−f(0)∥2=2, while for t∈[0,1] one has ∥f′(t)∥2=ι(4)t2+ι(9)t4≤ι(4)+ι(9)=ι(13), so M:=ι(13) bounds ∥f′∥2 on (0,1) and 2≤ι(13)=M(1−0).

step 1.1step 1.2L4L6L7∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

A curve for which the mean value inequality is an equality, showing the constant cannot be improved

Statement refuted

Refuted claim: the inequality of The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a) can be improved: there is a real c<1 such that for every m≥1, every a<b and every f:[a,b]→Rm continuous on [a,b] and differentiable on (a,b) with ∥f′∥2≤M there,

∥f(b)−f(a)∥2  ≤  c M (b−a).

The witness. Take m=2, [a,b]=[0,1] and f:[0,1]→R2 with f0(t)=t and f1(t)=0. Then ∥f′(t)∥2=1 for every t∈(0,1), so M=1 is admissible, and

∥f(1)−f(0)∥2  =  1  =  M (1−0).

The inequality of The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a) is therefore an equality on this curve, and no constant smaller than 1 can stand in front of M(b−a).

Facts & Assumptions

Given: The function f:[0,1]→R2 with f0(t)=t and f1(t)=0.

[A1]

Counterexample

technique · direct
1.1

Each component of f is differentiable at every real, with f0′(t)=1 and f1′(t)=0; so f is differentiable at every t∈[0,1] with f′(t)=(1,0), and f is continuous on [0,1].

L1L2
1.2

f(1)=(1,0) and f(0)=(0,0), so f(1)−f(0)=(1,0) and ∥f(1)−f(0)∥2=1.

L3
2.1

∥f′(t)∥2=12+02=1 for every t, so M:=1 satisfies the hypothesis ∥f′∥2≤M on (0,1), and M≥0.

step 1.1L3
4.1

Suppose [A1] held with some real c<1. Applied to this curve it would give 1≤c⋅1⋅1=c<1, which is impossible. So no constant smaller than 1 works, and [A1] is false.

step 1.2step 3.1A1L5∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

The comparison constants between ∥⋅∥1, ∥⋅∥2 and ∥⋅∥∞ on R2, and vectors attaining each

Example

On R2 with the norms of The p-norms ∥x∥p for rational p≥1, and ∥x∥∞, the comparison chain of The finite and reverse triangle inequalities for a norm; and for n≥1 every norm N on Rn satisfies N(x)≤C∥x∥1 and is Lipschitz, hence continuous, for d2 clause 3 reads

∥x∥∞  ≤  ∥x∥2  ≤  ∥x∥1  ≤  ι(2) ∥x∥∞,∥x∥1  ≤  ι(2)  ∥x∥2.

Each of these four constants is attained, so none can be improved:

  • e0=(1,0) has ∥e0∥∞=∥e0∥2=∥e0∥1=1, so the first and second inequalities are equalities there;
  • (1,1) has ∥(1,1)∥∞=1, ∥(1,1)∥2=ι(2) and ∥(1,1)∥1=ι(2), so the third and fourth inequalities are equalities there.

The general theorem For n≥1 all norms on Rn are equivalent supplies constants but no attaining vectors; that is what this computation adds.

Unit balls. Writing Bp:={ x∈R2:∥x∥p≤1 } for p∈{1,2,∞}, the chain gives B1⊆B2⊆B∞, and both inclusions are strict: (1,1) lies in B∞ and not in B2, and (3/ι(5))(1,1) lies in B2 and not in B1. The scalar has to be chosen strictly between 1/ι(2) and 1/ι(2): at the endpoint 1/ι(2) the vector (1,1)/ι(2) has ∥⋅∥1=1 and so still lies in B1.

Facts & Assumptions

[L1]

The comparison chain on Rn for n≥1, at n=2: ∥x∥∞≤∥x∥2≤∥x∥1≤ι(2)∥x∥∞ and ∥x∥1≤ι(2)∥x∥2 (The finite and reverse triangle inequalities for a norm; and for n≥1 every norm N on Rn satisfies N(x)≤C∥x∥1 and is Lipschitz, hence continuous, for d2 clause 3, The Cauchy-Schwarz inequality for finite sums).

[L3]

Square roots: c is the unique nonnegative s with s2=c, so 1=1, and squaring is strictly monotone on the nonnegatives (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Squaring is monotone on the nonnegatives).

[L4]

Canonical naturals: ι(1)=1, ι(2)=1+1>1, ι(2)>0, and ι is strictly increasing (The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing).

[L5]

Absolute value: ∣1∣=1, ∣0∣=0, ∣t∣≥0 (Absolute value in an ordered field, Basic properties of the absolute value).

Verification

technique · direct
1.1

∥e0∥1=∣1∣+∣0∣=1, ∥e0∥2=12+02=1=1, and ∥e0∥∞=max⁡{1,0}=1.

L3L5
1.2

∥u∥1=∣1∣+∣1∣=ι(2), ∥u∥2=12+12=ι(2), and ∥u∥∞=max⁡{1,1}=1.

L3L4L5
1.3

The inclusions B1⊆B2⊆B∞ follow from the chain: ∥x∥1≤1 gives ∥x∥2≤1, and that gives ∥x∥∞≤1.

L1L2
2.1

At x=e0 the first inequality of [L1] reads 1≤1 and the second reads 1≤1: both are equalities, so neither ∥⋅∥∞≤∥⋅∥2 nor ∥⋅∥2≤∥⋅∥1 can be improved by a constant smaller than 1.

step 1.1L1
2.2

At x=u the third inequality of [L1] reads ι(2)≤ι(2)⋅1 and the fourth reads ι(2)≤ι(2)⋅ι(2)=ι(2): both are equalities, so the constants ι(2) and ι(2) are best possible.

step 1.2L1L3
2.3

The inclusions are strict: u has ∥u∥∞=1 and ∥u∥2=ι(2)>1 since ι(2)>1, so u∈B∞∖B2; and w:=(3/ι(5))u has ∥w∥1=ι(2)⋅3/ι(5)=ι(6)/ι(5)>1 while ∥w∥2=ι(2)⋅3/ι(5) satisfies ∥w∥22=ι(2)⋅ι(9)/ι(25)=ι(18)/ι(25)<1, so w∈B2∖B1.

step 1.2L2L3L4
3.1

Steps 2.1 and 2.2 exhibit an attaining vector for each of the four inequalities, and steps 1.3 and 2.3 give the strict inclusions of the unit balls.

step 2.1step 2.2step 1.3step 2.3∎

Remarks

  • Sharpness is not the same as equivalence. For n≥1 all norms on Rn are equivalent asserts that constants exist and produces some; nothing in it says which are smallest. The computation above supplies attaining vectors, and those are what make the constants of the chain best possible on R2.

  • Both attaining vectors are extreme in the expected way. A vector with a single nonzero coordinate makes all three norms agree; a vector whose two coordinates have equal absolute value spreads the mass as evenly as possible and is where ∥⋅∥1 is largest relative to the other two. On Rn the same two vectors give equality with ι(n) and ι(n) in place of ι(2) and ι(2); only the case n=2 is verified here.

  • The strictness computation in step 2.3 is arithmetic, not geometry. The scalar 3/ι(5) was chosen to lie strictly between 1/ι(2) and 1/ι(2); any scalar in that open interval would serve, and the interval is nonempty exactly because ι(2)<ι(2).

CounterexampleConstruction: AI-adaptedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

∥⋅∥1 on R2 violates the parallelogram law, so no symmetric bilinear form induces it

Statement refuted

Refuted claim: every norm on R2 arises from a symmetric bilinear form, that is, for every norm N there is a function B:R2×R2→R that is symmetric and additive and homogeneous in each argument, with N(x)=B(x,x) for every x.

The witness is N:=∥⋅∥1 on R2 (The p-norms ∥x∥p for rational p≥1, and ∥x∥∞), and the obstruction is the parallelogram law, which every such N satisfies (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation clause 3 is the instance for the Euclidean form, and the general computation is two lines of bilinearity, done below) and which ∥⋅∥1 fails at x=e0, y=e1.

What is and is not claimed. What is refuted is the displayed claim, whose hypothesis is a symmetric bilinear form on R2 written out in full. The general converse — that a norm satisfying the parallelogram law is induced by an inner product, the Jordan-von Neumann theorem — is not proved here and is not used here. Abstract inner-product spaces are developed on a separate published page; the refutation below uses only bilinearity and the explicit one-norm calculation (Conventions of this page, the standing n≥1 hypothesis, and what is taken up elsewhere in the reading order).

Facts & Assumptions

[A1]

The refuted claim at N=∥⋅∥1: there is a symmetric B:R2×R2→R, additive and homogeneous in each argument, with ∥x∥1=B(x,x) for every x∈R2.

[L2]

Absolute values: ∣1∣=∣−1∣=1 and ∣0∣=0 (Absolute value in an ordered field, Basic properties of the absolute value).

[L3]

Square roots: c is the unique nonnegative s with s2=c, so (B(x,x))2=B(x,x) whenever B(x,x)≥0 (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Integer powers am).

[L4]

Canonical naturals are strictly increasing and positive and carry sums to sums and products to products, so ι(2)2=ι(4), ι(4)+ι(4)=ι(8), 2⋅1+2⋅1=ι(4) and ι(8)≠ι(4) (The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing).

Counterexample

technique · direct
1.1

Assume [A1] and write Q(x):=B(x,x), so ∥x∥12=Q(x) for every x.

A1L3
1.2

By symmetry and additivity and homogeneity in each argument, Q(x+y)=B(x+y,x+y)=Q(x)+2B(x,y)+Q(y) and Q(x−y)=Q(x)−2B(x,y)+Q(y), hence Q(x+y)+Q(x−y)=2Q(x)+2Q(y) for all x,y.

A1
1.3

Computing: ∥(1,1)∥1=∣1∣+∣1∣=ι(2) and ∥(1,−1)∥1=∣1∣+∣−1∣=ι(2), while ∥e0∥1=∥e1∥1=1.

L1L2
2.1

Instantiate step 1.2 at x=e0, y=e1: the left side is ∥(1,1)∥12+∥(1,−1)∥12 and the right side is 2∥e0∥12+2∥e1∥12.

step 1.1step 1.2
3.1

So the left side of step 2.1 is ι(2)2+ι(2)2=ι(4)+ι(4)=ι(8) and the right side is 2⋅1+2⋅1=ι(4), giving ι(8)=ι(4), which contradicts the strict increase of ι.

step 2.1step 1.3L4
4.1

Hence [A1] is false: no symmetric bilinear form on R2 induces ∥⋅∥1, and in particular ∥⋅∥1≠∥⋅∥2.

step 1.1step 3.1A1
5.1

The parallelogram law does hold for ∥⋅∥2, which is induced by the Euclidean inner product, so the failure above is a genuine separation between the two norms and not a defect of the computation.

L5∎

Remarks

  • Equivalence of norms says nothing about inner products. By For n≥1 all norms on Rn are equivalent the norms ∥⋅∥1 and ∥⋅∥2 on R2 are equivalent: they have the same open sets, the same convergent sequences and the same Cauchy sequences. What the computation above shows is that they are nevertheless different norms, and that one of them cannot be written as B(⋅,⋅) for any symmetric bilinear B. Equivalence is a metric statement; the parallelogram law is not.

  • Only one instance of the law is needed. The claim is refuted by a single pair (e0,e1), and the arithmetic is ι(8)≠ι(4). No general theory is required, which is exactly why this item can be stated on a page that has no abstract inner products.

  • The converse direction is a different theorem. That a norm satisfying the parallelogram law is induced by an inner product is the Jordan-von Neumann theorem, proved by polarisation; Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation clause 4 contains the polarisation identity for the Euclidean form, but the general theorem needs the abstract theory and is not asserted anywhere in this library.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-09-10 (Codex)Open item page →

g(x,y)=xy/(x2+y2), extended by g(0,0)=0, is continuous in each variable separately and not continuous at the origin

Statement refuted

Refuted claim: a function g:R2→R that is continuous in each variable separately — that is, for which t↦g(t,b) and t↦g(a,t) are continuous on R for every fixed a and b (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point) — is continuous as a map (R2,d2)→(R,dR) (Vector-valued functions f:A→Rm, their limits and continuity, with the dictionary to the metric notions, Continuity of a map between metric spaces, at a point and globally, in the ε-δ form, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

The witness. Define g:R2→R by

g(p)  :=  p0 p1p02+p12  for p≠0,g(0):=0,

writing p=(p0,p1) for an element of R2, the set of functions 2→R (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it). The quotient is defined for p≠0 because p02+p12=∥p∥22>0 there (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

Then g is continuous in each variable separately at every point, and g is not continuous at 0.

This is the first function on R2 whose continuity this library studies, and its domain is R2 with the published metric d2, not an informal plane.

Facts & Assumptions

Given: The function g:R2→R above; the sequence p(k):=(1/ι(k+1), 1/ι(k+1)) in R2 (Sequences of reals: bounded, eventually, frequently, tails, subsequences, The canonical natural ι(n)=n⋅1F of a field).

[A1]

The refuted claim, at this g: separate continuity everywhere implies continuity as a map (R2,d2)→(R,dR).

For completeness, the pointwise implication in [L1] follows directly from the definitions: given a real ε>0, continuity at q supplies a real δ>0 such that d(p,q)<δ implies ∣g(p)−g(q)∣<ε. Convergence p(k)→q supplies K with d(p(k),q)<δ for all k≥K, using the rational-to-real tolerance agreement in Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R. Hence ∣g(p(k))−g(q)∣<ε for all k≥K. This proves the pointwise implication without assuming continuity elsewhere or any choice principle.

Counterexample

technique · direct
1.1

For a fixed real b≠0 the function t↦g(t,b)=tb/(t2+b2) is a quotient of two polynomial functions of t whose denominator never vanishes, since t2+b2≥b2>0; so it is continuous on R.

L3L5
1.2

For b=0 the function t↦g(t,0) is constantly 0: at t≠0 its value is t⋅0/(t2+0)=0, and at t=0 it is g(0)=0. A constant function is continuous.

L3L5
1.3

Each coordinate sequence of (p(k)) is k↦1/ι(k+1), which converges to 0: given a rational ε>0, an index K with 1/ι(K+1)<ε gives 0<1/ι(k+1)≤1/ι(K+1)<ε for every k≥K. Hence p(k)→0 in (R2,d2).

L2L4
2.1

By the symmetry g(p0,p1)=g(p1,p0), the same two arguments give continuity of t↦g(a,t) for every fixed real a.

step 1.1step 1.2
2.2

For every k the point p(k) is nonzero, and with u:=1/ι(k+1) its value is g(p(k))=u⋅u/(u2+u2)=u2/(ι(2)u2)=1/ι(2).

step 1.3L4L5
3.1

So g is continuous in each variable separately at every point of R2.

step 1.1step 1.2step 2.1
3.2

So the constant sequence (g(p(k))) converges to 1/ι(2), while g(0)=0 and 1/ι(2)≠0 because ι(2)>0. More directly, this sequence cannot converge to g(0)=0: its distance from 0 is always 1/ι(2), so the convergence test fails at the positive rational tolerance 1/ι(4).

step 2.2L4
4.1

By the contrapositive of the fact that continuity preserves convergent sequences, g is not continuous at 0: the sequence p(k)→0 has g(p(k))↛g(0).

step 1.3step 2.2step 3.2L1
5.1

Steps 3.1 and 4.1 together refute [A1]: g is separately continuous everywhere and is not continuous at the origin.

step 3.1step 4.1A1∎

Remarks

  • What the sequence sees. Along the line p1=p0 the value of g is constantly 1/ι(2) off the origin, and points of that line come arbitrarily close to the origin; along either axis the value is constantly 0. So the two partial functions through the origin cannot detect what a general approach does, and that is the whole phenomenon.

  • Separate continuity is strictly weaker, and no repair is proposed here. What the refuted claim would need is a hypothesis controlling the two variables together — joint continuity is exactly such a hypothesis, and it is what Vector-valued functions f:A→Rm, their limits and continuity, with the dictionary to the metric notions defines. Nothing here claims that any weaker hypothesis suffices.

  • Nothing is claimed about g away from the origin. The refutation needs only the behaviour of g at 0 together with the two partial functions, and that is all that is proved. In particular this item does not assert that g is continuous at the points p≠0, true though that is; establishing it would need an algebra of continuous real-valued functions on a metric domain, which A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions provides for sums, scalar multiples and inner products but not for quotients.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

A convergent sequence in R3 and the integral ∫01(1,t,t2), computed componentwise

Example

Two parts of the vector-valued toolkit are exercised here, in R3: componentwise sequence convergence and componentwise integration.

A convergent sequence. For k∈N put

x(k)  :=  (1ι(k+1), 1−1ι(k+1), 2)  ∈  R3,

with ι the canonical natural (The canonical natural ι(n)=n⋅1F of a field); the shift by one is there because N contains 0 and ι(0)=0. Then x(k)→(0,1,2) in (R3,d2).

An integral. Let f:[0,1]→R3 be f(t):=(1, t, t2). Then f is integrable and

∫01f  =  (1, 1ι(2), 1ι(3)).

The norm inequality is strict here. ∥∫01f∥2=ι(7)/ι(6), while ∫01∥f∥2≥ι(53)/ι(45)>ι(7)/ι(6). The exact value of ∫011+t2+t4 dt is not computed: it needs machinery this page does not have, and a crude lower bound is enough to separate the two sides of For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable.

Facts & Assumptions

Given: The sequence (x(k)) and the function f above; the abbreviation g(t):=∥f(t)∥2=1+t2+t4 (The p-norms ∥x∥p for rational p≥1, and ∥x∥∞, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L7]

Square roots and squaring: c is the unique nonnegative s with s2=c, and for a,b≥0, a≤b exactly when a2≤b2 (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Squaring is monotone on the nonnegatives).

[L8]

Canonical naturals carry sums to sums and products to products and are strictly increasing and positive (Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n⋅1F of a field).

Verification

technique · direct
1.1

The three coordinate sequences of (x(k)) are k↦1/ι(k+1), k↦1−1/ι(k+1) and the constant 2. Given a real ε>0, take K with 1/ι(K+1)<ε; then for k≥K one has 0<1/ι(k+1)≤1/ι(K+1)<ε, so the first converges to 0, the second to 1 and the third to 2.

L2
1.2

Each component of f is a polynomial function, hence continuous on [0,1] and integrable there; so f is integrable, and f is continuous.

L3L4L9
1.3

The function t↦t p+1/ι(p+1) is a primitive of t↦tp for p∈N, so ∫01tp dt=1/ι(p+1); at p=0,1,2 this gives 1, 1/ι(2) and 1/ι(3).

L4L8
1.4

For t∈[0,1] put u:=t2+t4, so 0≤u≤ι(2)≤ι(3) and g(t)=1+u. Since (1+u/ι(3))2=1+ι(2)u/ι(3)+u2/ι(9)≤1+u exactly when u2/ι(9)≤u/ι(3), that is exactly when u≤ι(3), and both 1+u/ι(3) and 1+u are nonnegative, monotonicity of squaring gives g(t)≥1+(t2+t4)/ι(3).

L7L8
1.5

Finally ι(53)/ι(45)>ι(7)/ι(6), since cross-multiplying by the positive ι(45)ι(6) turns the claim into ι(318)>ι(315), which holds because ι is strictly increasing.

L8
2.1

Hence x(k)→(0,1,2) in (R3,d2), the ε for the vector being obtained from the three coordinate tolerances exactly as in the proof of [L1].

step 1.1L1
2.2

Therefore ∫01f=(1, 1/ι(2), 1/ι(3)), the coordinates of the vector integral being the integrals of the coordinates.

step 1.2step 1.3L3
2.3

The right-hand side of step 1.4 is continuous, hence integrable, and by step 1.3 and linearity ∫01(1+(t2+t4)/ι(3))dt=1+(1/ι(3)+1/ι(5))/ι(3)=1+ι(8)/ι(45)=ι(53)/ι(45).

step 1.3L4L5L8
3.1

Its Euclidean norm satisfies ∥∫01f∥22=1+1/ι(4)+1/ι(9)=ι(49)/ι(36), so ∥∫01f∥2=ι(7)/ι(6), since (ι(7)/ι(6))2=ι(49)/ι(36) and both numbers are nonnegative.

step 2.2L7L8
3.2

By monotonicity of the integral, using that g is integrable, ∫01g≥ι(53)/ι(45).

step 1.4step 2.3L5L6
4.1

So ∥∫01f∥2=ι(7)/ι(6)<ι(53)/ι(45)≤∫01∥f∥2: the inequality of [L6] holds on this example and is strict.

step 3.1step 3.2step 1.5L6∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

Steinitz's confinement bound realised on an explicit list of six unit vectors in R2 summing to zero

Example

Take n=2 and m=6, and let a:=1/ι(2), so that u:=(a,a)∈R2 has ∥u∥2=a2+a2=1. Define v:6→R2 by

v0:=e0,v1:=−e1,v2:=u,v3:=−e0,v4:=e1,v5:=−u,

with e0=(1,0) and e1=(0,1) (The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0). Every ∥vi∥2 is 1 and ∑i<6vi=0, so Steinitz's polygonal confinement theorem: finitely many vectors of norm at most 1 summing to 0 can be ordered so that every partial sum has norm at most n applies and asserts an ordering all of whose partial sums have norm at most ι(2).

A good ordering. The identity ordering works: the partial sums sk=∑j<kvj are

s0=(0,0),s1=(1,0),s2=(1,−1),s3=(1+a, a−1),s4=(a, a−1),s5=(a,a),s6=(0,0),

with norms 0, 1, ι(2), ι(3), ι(2)−ι(2), 1, 0, each at most ι(2).

A bad ordering, which exceeds the bound. Reordering as e0,e1,u,−e0,−e1,−u gives the third partial sum (1+a, 1+a), whose norm squared is ι(3)+ι(2)ι(2)>ι(4). So that ordering has a partial sum of norm strictly greater than ι(2), and the theorem is saying something.

One step of the descending construction. With b6 the identity of 6 and μj6:=ι(4)/ι(6) for j<6, the pair (b6,μ6) is admissible at k=6 in the sense of the proof of Steinitz's polygonal confinement theorem: finitely many vectors of norm at most 1 summing to 0 can be ordered so that every partial sum has norm at most n. At the next stage the feasible set is

Λ  =  { μ∈[0,1]6  :  ∑j<6μjvj=0, ∑j<6μj=ι(3) },

and μ:=(1, 1ι(2), 0, 1, 1ι(2), 0) lies in it with exactly two coordinates strictly between 0 and 1, which is the least possible. Its support is {0,1,3,4}, of size 4≤k−1=5, so the support bound holds with room; dropping the coordinate j0=5 gives the admissible pair at k=5 with b5=(0,1,2,3,4) and μ5=(1, 1ι(2), 0, 1, 1ι(2)).

Facts & Assumptions

Given: The list v:6→R2 above, with a=1/ι(2) and u=(a,a); the partial sums sk=∑j<kvj of the identity ordering; the vector μ=(1,1/ι(2),0,1,1/ι(2),0).

[L2]

Square roots: c is the unique nonnegative s with s2=c; (ι(2))2=ι(2); and for c,d≥0, c≤d exactly when c≤d (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Squaring is monotone on the nonnegatives, Integer powers am).

[L3]

Canonical naturals are positive and strictly increasing and carry sums to sums and products to products (The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing); inverses of positives are positive (Inverses of positives are positive, and reciprocation reverses order).

Verification

technique · direct
1.1

a2=1/ι(2) by [L2], so ∥u∥22=a2+a2=1 and ∥u∥2=1; also ∥e0∥2=∥e1∥2=1 and ∥−y∥2=∥y∥2. Hence ∥vi∥2=1 for every i<6.

L1L2L3
1.2

∑i<6vi=(e0−e0)+(−e1+e1)+(u−u)=0, computing coordinatewise.

L4
1.3

For the ordering e0,e1,u,−e0,−e1,−u the third partial sum is (1+a,1+a), whose norm squared is ι(2)(1+a)2=ι(2)+ι(2)ι(2)a+ι(2)a2=ι(3)+ι(2)ι(2), using ι(2)a=ι(2)/ι(2)=ι(2).

L1L2L3
1.4

The vector μ=(1,1/ι(2),0,1,1/ι(2),0) lies in Λ: its values lie in [0,1]; ∑j<6μj=1+1/ι(2)+0+1+1/ι(2)+0=ι(3); and ∑j<6μjvj=(v0+v3)+(1/ι(2))(v1+v4)=0+0=0.

L3L4
2.1

The partial sums of the identity ordering are as displayed, by the recursion of [L4] applied coordinatewise.

step 1.2L4
2.2

Since ι(2)>1 and ι(2)>0, the quantity of step 1.3 exceeds ι(3)+ι(2)=ι(5)>ι(4), so that partial sum has norm strictly greater than ι(2): a bad ordering really does break the bound.

step 1.3L2L3
2.3

The pair (b6,μ6) with b6 the identity of 6 and μj6=ι(4)/ι(6) is admissible at 6: the values lie in [0,1], ∑j<6μj6vj=(ι(4)/ι(6))∑j<6vj=0, and ∑j<6μj6=ι(6)⋅ι(4)/ι(6)=ι(4).

step 1.2L3L4L5
2.4

No element of Λ has fewer than two strictly fractional coordinates. If none were fractional, μ would be a {0,1}-vector with ∑jμj=ι(3), hence with support of size 3, and ∑j∈supp⁡vj=0; the support cannot contain a pair {0,3}, {1,4} or {2,5}, since the remaining single vector would then have to be 0 while all six are nonzero, so it contains exactly one index from each pair and the sum is ±e0±e1±u, whose second coordinate is ±1±a and whose first is ±1±a, and ∣±1±a∣≠0 because a≠1 (indeed a2=1/ι(2)≠1). If exactly one coordinate were fractional, say with value t, then ∑jμj would be t plus a canonical natural and could not equal ι(3).

step 1.4L1L2L3
3.1

Their norms squared are 0, 1, ι(2), (1+a)2+(a−1)2=ι(2)+ι(2)a2=ι(3), a2+(a−1)2=ι(2)−ι(2)a, ι(2)a2=1 and 0.

step 2.1L1L2L3
3.2

So μ of step 1.4 is a minimiser, its support is {0,1,3,4} of size 4, and 4≤5=k−1 at k=6: the support bound of [L5] holds, and a coordinate with value 0 exists, for instance j0=5.

step 1.4step 2.4L5
4.1

Each of these is at most ι(4): the largest is ι(3), and ι(2)−ι(2)a≤ι(2) because a>0. So every partial sum of the identity ordering has norm at most ι(4)=ι(2), and the identity ordering realises the bound of [L5].

step 3.1L2L3L5
4.2

Deleting position 5 gives b5=(0,1,2,3,4) and μ5=(1,1/ι(2),0,1,1/ι(2)), with ∑j<5μj5=ι(3) and ∑j<5μj5vb5(j)=0: an admissible pair at k=5.

step 1.4step 3.2L4L5
5.1

Steps 4.1, 2.2 and 4.2 give, in turn, an ordering realising the bound, an ordering violating it, and one traced step of the descending construction with its support bound checked.

step 4.1step 2.2step 4.2∎

Remarks

  • The bound ι(n) is not attained here. The largest partial-sum norm of the good ordering is ι(3), comfortably below ι(2). The theorem asserts existence of an ordering below ι(n) and claims no sharpness, and this example makes no claim about the optimal constant either.

  • What the bad ordering shows. Without the theorem there is no reason to expect any ordering to stay bounded independently of m: the third partial sum of the bad ordering already exceeds ι(2), and lists of many unit vectors summing to 0 can be ordered so that a partial sum has norm of order m.

  • Why one step of the construction is traced. An example that only asserted the bound would say nothing about how it is obtained. The step above exhibits the object the proof actually manipulates — a feasible vector of coefficients with as few fractional coordinates as possible — and checks the support bound #supp⁡≤k−1 that the descending construction turns on.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

A convergent series in R2 with Γ a line and Γ⊥ a line, computed from the definition

Example

Let (εk) be the alternating sequence, the unique sequence of reals with ε0=1 and εk+1=−εk, so ∣εk∣=1 for every k (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). In R2 put

xk  :=  (εkι(k+1), 0)(k∈N),

with ι the canonical natural (The canonical natural ι(n)=n⋅1F of a field). Call a line through the origin the set of scalar multiples of a fixed nonzero vector; each such set is a linear subspace (Linear subspace of a vector space). Then:

  1. ∑xk converges, to s=(S,0) where S is the sum of the alternating harmonic series; the value of S is not computed here, being a logarithm and outside this page's reach.
  2. ∑xk does not converge absolutely (Series of vectors in Rn, absolute convergence, rearrangement, and the set of rearrangement sums).
  3. Γ={ (0,t):t∈R }, the line of multiples of e1, and Γ⊥={ (t,0):t∈R }, the line of multiples of e0 (The subspace Γ of directions along which a series converges absolutely, and its orthogonal complement Γ⊥).
  4. Consequently The set of rearrangement sums of a convergent series in Rn is a nonempty subset of the affine subspace s+Γ⊥ confines every rearrangement sum to the horizontal line s+Γ⊥={(t,0):t∈R}; and for this series the confinement is exact, S(x)=s+Γ⊥, by the published The Riemann series theorem: a conditionally convergent real series has, for every c∈R, a rearrangement with sum c, and rearrangements diverging to +∞, to −∞, and oscillating with any prescribed lim inf⁡≤lim sup⁡ in R‾ applied to the first coordinate.

Clause 4 decides nothing about the general question. This series is degenerate: it lies inside a line, so its rearrangement behaviour is the one-dimensional behaviour of its first coordinate and nothing more. It is therefore not evidence about whether S(x)=s+Γ⊥ for a series genuinely spread over Rn with n≥2, a question this library does not settle (Conventions of this page, the standing n≥1 hypothesis, and what is taken up elsewhere in the reading order).

Facts & Assumptions

Given: The sequence (xk) above, its first coordinate sequence ck:=εk/ι(k+1) and the sequence bk:=1/ι(k+1).

[L4]

The p-series theorem: ∑k≥11/kp converges if and only if p>1; at p=1 the harmonic series diverges (For rational p>0, ∑1/kp converges iff p>1, Rational powers ar of a positive base, Series, partial sums, convergence and the sum, divergence, and the tail series).

[L7]

For c≠0, ∑c ak converges if and only if ∑ak converges (Convergent series add and scale termwise clause 3).

Verification

technique · direct
1.1

(bk) is positive, nonincreasing and converges to 0: positivity and monotonicity from 0<ι(k+1)<ι(k+2), and convergence because for a rational ε>0 an index K with 1/ι(K+1)<ε gives bk≤bK<ε for k≥K.

L2
1.2

The second coordinate sequence is constantly 0, so its series converges with sum 0.

L5
2.1

By the alternating series test ∑kck=∑kεkbk converges; write S for its sum.

step 1.1L3
2.2

∥xk∥2=ck2+0=∣ck∣=∣εk∣bk=bk, and ∑kbk is the harmonic series, which diverges; so ∑xk does not converge absolutely, which is clause 2.

step 1.1L1L4L6
3.1

By componentwise convergence, ∑xk converges with sum s=(S,0), which is clause 1.

step 2.1step 1.2L5
3.2

For a=(a0,a1)∈R2: ⟨a,xk⟩=a0ck, so ∣⟨a,xk⟩∣=∣a0∣ bk. If a0=0 every term is 0 and the series converges; if a0≠0 then ∣a0∣>0 and convergence of ∑k∣a0∣bk would give convergence of ∑kbk, which is false.

step 2.2L1L6L7
3.3

Conversely let t∈R. The real series ∑kck converges by step 2.1 and does not converge absolutely by step 2.2, so it converges conditionally, and the Riemann series theorem supplies a bijection σ of N with ∑kcσ(k)=t. The rearranged vector series ∑kxσ(k) has first coordinate series ∑kcσ(k) and second coordinate series constantly 0, so by componentwise convergence it converges to (t,0); hence (t,0)∈S(x).

step 2.1step 2.2L5L8
4.1

Hence Γ={a:a0=0}={(0,t):t∈R}, the set of scalar multiples of e1.

step 3.2L6
5.1

For y=(y0,y1): y∈Γ⊥ means ⟨(0,t),y⟩=t y1=0 for every real t, which at t=1 forces y1=0, and conversely y1=0 makes every such product 0. So Γ⊥={(t,0):t∈R}, the set of scalar multiples of e0, and clause 3 is proved.

step 4.1L6
6.1

By the containment theorem, S(x)⊆s+Γ⊥={ (S+t, 0):t∈R }={ (w,0):w∈R }.

step 3.1step 5.1L8
7.1

Steps 6.1 and 3.3 give S(x)=s+Γ⊥, which is clause 4.

step 6.1step 3.3∎

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

FALSE: if a convergent series in Rn does not converge absolutely, then every point of Rn is the sum of some rearrangement of it

Statement

False claim: let n≥1 and let (xk) be a sequence in Rn whose series converges but does not converge absolutely (Series of vectors in Rn, absolute convergence, rearrangement, and the set of rearrangement sums). Then every point of Rn is the sum of some rearrangement of ∑xk; that is, S(x)=Rn.

Where the claim comes from. For n=1 it is true, and it is the published The Riemann series theorem: a conditionally convergent real series has, for every c∈R, a rearrangement with sum c, and rearrangements diverging to +∞, to −∞, and oscillating with any prescribed lim inf⁡≤lim sup⁡ in R‾: a conditionally convergent real series can be rearranged to any prescribed sum. The claim above is the naive transfer of that theorem to Rn by analogy, and the analogy fails at n=2 already.

The witness uses the alternating sequence εk=(−1)k of 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 series xk=(εk/ι(k+1), 0) in R2, which converges, does not converge absolutely, and has no rearrangement sum off the horizontal axis. In particular (0,1) is not a rearrangement sum.

Facts & Assumptions

[A1]

The refuted claim, instantiated at n=2 and this (xk): every point of R2, in particular (0,1), is the sum of some rearrangement of ∑xk.

[L2]

A rearrangement of ∑xk is ∑xσ(k) for a bijection σ of N, and S(x) is the set of its sums (Series of vectors in Rn, absolute convergence, rearrangement, and the set of rearrangement sums, Injection, surjection, bijection).

Refutation

technique · direct
1.1

The second coordinate of every term xk is 0, so for every bijection σ of N the second coordinate of every partial sum ∑j<Nxσ(j) is the finite sum of zeros, namely 0.

L2L3
1.2

The hypotheses of the refuted claim are met by this series: it converges and does not converge absolutely.

L1
2.1

If a rearrangement ∑xσ(k) converges to a point t∈R2, then by componentwise convergence its second coordinate sequence, constantly 0 by step 1.1, converges to t1; a constant sequence converges to its value and limits are unique, so t1=0.

step 1.1L3
3.1

Hence every element of S(x) has second coordinate 0, and (0,1), whose second coordinate is 1≠0, is not a rearrangement sum.

step 2.1L2
4.1

So [A1] fails for a series satisfying the hypotheses of the refuted claim, and the claim is false.

step 1.2step 3.1A1
5.1

For a=(a0,a1), ∣⟨a,xk⟩∣=∣a0∣/ι(k+1). By harmonic divergence, this series converges exactly when a0=0: if a0≠0, multiplication by 1/∣a0∣ would otherwise make the harmonic series converge. Thus Γ is the vertical axis, and its orthogonal complement Γ⊥ is the horizontal axis. The containment theorem therefore also puts every rearrangement sum in the proper affine line s+Γ⊥.

L1L4given∎

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

FALSE: all norms on a real vector space are equivalent

Statement

False claim: any two norms on a real vector space are equivalent (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, Equivalent norms, and the dictionary with equivalent metrics).

What is true is the same statement for Rn with n a natural number, which is For n≥1 all norms on Rn are equivalent. Dropping the hypothesis that the space is one of the Rn makes the claim false, and the witness below is built from published material only.

The witness. Let RN be the function space of all functions N→R with pointwise operations (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}), and let

V  :=  { v∈RN  :  there is K∈N with vj=0 for every j≥K }

be the set of finitely supported sequences. On V define

N1(v):=∑j<K∣vj∣,N∞(v):=max⁡{ ∣vj∣:j<K },

for any K≥1 with vj=0 for j≥K. Both are norms on V, both values are independent of the admissible K chosen, and no real C satisfies N1≤C N∞ on V.

Facts & Assumptions

Given: The space RN, the subset V, the functions N1 and N∞ above, and, for m≥1, the vector u(m)∈V with uj(m)=1 for j<m and uj(m)=0 for j≥m. For i∈N, ei∈RN is the function with ei(i)=1 and ei(j)=0 for j≠i.

[A1]

The refuted claim: any two norms on a real vector space are equivalent.

[L3]

Laws of finite sums (Laws of finite sums and finite products, Finite sums and finite products, by recursion): additivity, scaling, splitting, monotonicity, a sum of nonnegative terms is nonnegative, a vanishing sum of nonnegative terms has all terms 0, and ∑j<m1=ι(m).

[L4]

Maxima (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set): a nonempty finite set of reals has a maximum, which belongs to it and bounds it above.

[L5]

Absolute value (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality): ∣t∣≥0; ∣t∣=0 exactly when t=0; ∣st∣=∣s∣∣t∣; ∣s+t∣≤∣s∣+∣t∣.

[L8]

Norm equivalence: M and N are equivalent when cM≤N≤CM for some reals c,C>0 (Equivalent norms, and the dictionary with equivalent metrics); the norm axioms are (N1), (N2), (N3) (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms); and induction (The principle of mathematical induction).

Refutation

technique · direct
1.1

V is a linear subspace of RN, hence a real vector space: it contains 0, and if vj=0 for j≥K and wj=0 for j≥K′ then (λv+w)j=0 for j≥max⁡{K,K′}.

L1L4
1.2

The values N1(v) and N∞(v) do not depend on the admissible K. If K≤K′ are both admissible, then splitting the sum gives ∑j<K′∣vj∣=∑j<K∣vj∣+∑j=KK′−1∣vj∣, and the second part is a sum of zeros; and max⁡{∣vj∣:j<K′}=max⁡{∣vj∣:j<K} because the extra entries are 0 and the maximum over j<K is ≥∣v0∣≥0.

L3L4L5
1.3

The hypothesis that fails is finite-dimensionality. For every p∈N the set { ei:i<p } is a subset of V with p elements, the map i↦ei being injective because ei(i)=1≠0=ei′(i) for i≠i′; and it is linearly independent, since for an injective list l↦eil into it and scalars λ, evaluating ∑l<qλleil=0 at the point il0 gives λl0=0, the list l↦λleil(il0) vanishing off the single index l0.

L2L3L5
2.1

N1 is a norm on V. (N1): N1(v)=0 forces every ∣vj∣=0 for j<K, hence v=0; and N1(0)=0. (N2): λv is admissible with the same K and ∑j<K∣λvj∣=∣λ∣∑j<K∣vj∣. (N3): with K admissible for both v and w, ∑j<K∣vj+wj∣≤∑j<K∣vj∣+∑j<K∣wj∣ termwise.

step 1.2L3L5L8
2.2

N∞ is a norm on V. (N1): N∞(v)=0 forces ∣vj∣≤0 and ≥0 for every j<K, hence v=0. (N2): max⁡{∣λvj∣}=∣λ∣max⁡{∣vj∣}, since ∣λ∣∣vj∣≤∣λ∣N∞(v) for every j with equality at an index attaining the maximum. (N3): ∣vj+wj∣≤∣vj∣+∣wj∣≤N∞(v)+N∞(w) for every j<K, and the maximum on the left is one of those numbers.

step 1.2L4L5L8
2.3

For m≥1 the vector u(m) lies in V, and K=m is admissible for it; so N1(u(m))=∑j<m1=ι(m) and N∞(u(m))=max⁡{1,…,1}=1.

step 1.2L3L4L5
2.4

So V has no finite basis: a basis B with q elements would span V, forcing every linearly independent subset to have at most q elements, while step 1.3 produces one with q+1. Hence V is infinite-dimensional, and For n≥1 all norms on Rn are equivalent, which is a statement about Rn for a natural n, does not apply to it.

step 1.3L7
3.1

Suppose N1 and N∞ were equivalent, so that in particular N1(v)≤C N∞(v) for every v∈V and some real C>0. Then ι(m)≤C for every m≥1, by step 2.3.

step 2.3L8
4.1

That contradicts the Archimedean property, which supplies a natural m≥1 with C<ι(m). So N1 and N∞ are not equivalent, and [A1] is false.

step 3.1A1L6
5.1

The claim [A1] is therefore false, and the true statement in its neighbourhood is For n≥1 all norms on Rn are equivalent, whose proof spends compactness of the Euclidean unit sphere, a property step 2.4 shows V has no analogue of.

step 4.1step 2.4A1∎

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

FALSE: in every normed space a closed bounded set is compact

Statement

False claim: in every normed space (W,N) (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms) a subset that is closed in the induced metric (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and bounded (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) is compact (Open cover, subcover, compact metric space, and compact subset of a metric space).

What is true is the same statement for Rn with the Euclidean norm and n a natural number, which is Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line clause 2. The published FALSE: a closed and bounded subset of a metric space is compact already refutes the corresponding claim for arbitrary metric spaces; the point of the present item is that adding a linear structure and a norm does not repair it, which a reader who has just met For n≥1 all norms on Rn are equivalent may well expect it to.

The witness is the space V of finitely supported real sequences with the norm N∞, both as in FALSE: all norms on a real vector space are equivalent, and the closed unit ball

K  :=  { v∈V:N∞(v)≤1 }.

K is closed in (V,dN∞) and bounded, and it is not compact: the vectors ek all lie in it and satisfy N∞(ej−ek)=1 for j≠k.

Facts & Assumptions

Given: The vector space V of finitely supported sequences and the norm N∞ on it, with induced metric d(v,w):=N∞(v−w); the set K above; and the vectors ek∈V with ek(k)=1 and ek(j)=0 for j≠k.

[A1]

The refuted claim, at (V,N∞) and K: K is compact.

[L6]

Pigeonhole: there is no injection from σ(p) into p, hence none from N into any natural number (The pigeonhole principle on N claims 1 and 4, Finite, countably infinite, countable, uncountable).

Refutation

technique · direct
1.1

Each ek lies in V, with K=k+1 admissible, and N∞(ek)=1; so ek∈K for every k.

L1L7
1.2

For j≠k the vector ej−ek has coordinates 1 at j, −1 at k and 0 elsewhere, so N∞(ej−ek)=1, that is d(ej,ek)=1.

L1L2L7
1.3

K is bounded, since K⊆B(0,2): v∈K gives d(v,0)=N∞(v)≤1<2.

L1L2L3
1.4

K is closed in (V,d). Let v∉K, so N∞(v)>1, and put r:=N∞(v)−1>0; if d(w,v)<r then N∞(w)≥N∞(v)−N∞(v−w)>N∞(v)−r=1, so w∉K. Hence the complement of K is open.

L2L3
2.1

No subsequence of (ek) is Cauchy in (V,d): if l↦enl were, with n strictly increasing and hence injective, then taking the tolerance 1/2 would give indices l≠l′ with d(enl,enl′)<1/2, while nl≠nl′ and step 1.2 make that distance 1.

step 1.2L5
3.1

Hence no subsequence of (ek) converges in the metric subspace (K,dK), a convergent sequence being Cauchy and dK being the restriction of d; so (K,dK) is not sequentially compact.

step 2.1L4L5
4.1

If K were compact then (K,dK) would be a compact metric space and hence sequentially compact, contradicting step 3.1. So [A1] is false, and with steps 1.3 and 1.4 the set K is closed and bounded and not compact.

step 1.3step 1.4step 3.1A1L4
5.1

The same family shows that (K,dK) is not totally bounded, which is the property the general characterisation identifies as missing. Suppose {y0,…,yp}⊆K were a finite 1/2-net. Assigning to each k∈N the least i≤p with d(ek,yi)<1/2 gives a map N→σ(p), which cannot be injective by pigeonhole; so there are j≠k and one i with d(ej,yi)<1/2 and d(ek,yi)<1/2, whence d(ej,ek)≤d(ej,yi)+d(yi,ek)<1, contradicting step 1.2.

step 1.2L6L8∎

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)Open item page →

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

Sources