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.
R^n as a Normed Space; Vector-Valued Functions: Examples and Counterexamples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Filters and Ultrafilters
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
on : no satisfies
Statement refuted
Refuted claim: if is continuous on and differentiable on , then there is with
That is the equality form of the mean value theorem (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ), which is true for and false for . What survives is the inequality of The mean value inequality: if is continuous and differentiable on with , then , and this item is the witness showing that the inequality cannot be upgraded.
The witness. Take , and with components and (Integer powers , Vector-valued functions , their limits and continuity, with the dictionary to the metric notions).
Why this curve and not the classical one. The crispest classical witness is on , whose derivative has constant norm 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 with and , and the reals (The canonical natural of a field).
The refuted claim, instantiated at , , : there is with , that is .
Derivatives of powers: is differentiable at every real with derivative for (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, Integer powers , The canonical natural of a field).
A vector-valued function is differentiable at a point exactly when each component is, and then ; equality of two elements of is equality of both coordinates (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral, 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, The derivative of at a point that is a limit point of , and differentiability on a set, The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
Differentiability implies continuity (A function differentiable at is continuous at , Vector-valued functions , their limits and continuity, with the dictionary to the metric notions, 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).
The Euclidean norm: on , and is the unique nonnegative square root (The -norms for rational , and , The Euclidean inner product on , Square roots exist: a unique with ; the positives are , A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, Laws of finite sums and finite products, Finite sums and finite products, by recursion).
Canonical naturals are positive and strictly increasing, and carry sums to sums and products to products, so , , and (Canonical naturals are positive and strictly increasing, The canonical natural of a field).
Squaring is strictly monotone on the nonnegatives, so square roots compare in the same direction (Squaring is monotone on the nonnegatives).
The mean value inequality (The mean value inequality: if is continuous and differentiable on with , then ) and the algebra of derivatives (Sums, scalar multiples, products and quotients: , , , and when ), together with the interval notation (Intervals of : the nine order-convex forms, nondegeneracy, and length).
Counterexample
Each component is differentiable at every real, with and ; hence is differentiable at every with , and is continuous on .
and , so .
Suppose [A1] holds and let be as there; comparing first coordinates gives , so .
Comparing second coordinates gives .
Substituting into step 2.2 gives , hence , contradicting the strict increase of .
So no satisfies [A1], and the refuted claim is false for .
The inequality form does hold on this curve, with room to spare: , while for one has , so bounds on and .
Remarks
-
What exactly fails. The scalar mean value theorem is applied in the proof of The mean value inequality: if is continuous and differentiable on with , then to the auxiliary function for the fixed vector , and it does produce a point . That is a mean value point of that real function, and it depends on ; there is no reason for the two coordinates to be served by one and the same point, and on this curve they are not: the first coordinate demands and the second demands .
-
The curve is not pathological. Both components are polynomials, so is differentiable at every real (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term) and is continuous. No smoothness hypothesis would rescue the equality form.
-
The bound of The mean value inequality: if is continuous and differentiable on with , then is not merely true but sharp, and the companion item A curve for which the mean value inequality is an equality, showing the constant cannot be improved exhibits a curve on which it is an equality. The two items together show that the failure of the equality form is not a failure of the bound.
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 is continuous and differentiable on with , then can be improved: there is a real such that for every , every and every continuous on and differentiable on with there,
The witness. Take , and with and . Then for every , so is admissible, and
The inequality of The mean value inequality: if is continuous and differentiable on with , then is therefore an equality on this curve, and no constant smaller than can stand in front of .
Facts & Assumptions
Given: The function with and .
The refuted claim: there is a real with in the situation of The mean value inequality: if is continuous and differentiable on with , then .
Derivatives of powers: is differentiable at every real with derivative , and a constant function has derivative (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term claims 1 and 2, The derivative of at a point that is a limit point of , and differentiability on a set, Integer powers , The canonical natural of a field).
A vector-valued function is differentiable at a point exactly when each component is, with , and is continuous when each component is (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral, 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, Vector-valued functions , their limits and continuity, with the dictionary to the metric notions, A function differentiable at is continuous at , Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function).
and is positive on the naturals (Canonical naturals are positive and strictly increasing, The canonical natural of a field).
Counterexample
Each component of is differentiable at every real, with and ; so is differentiable at every with , and is continuous on .
and , so and .
for every , so satisfies the hypothesis on , and .
The conclusion of The mean value inequality: if is continuous and differentiable on with , then on this curve reads : the inequality holds and is an equality.
Suppose [A1] held with some real . Applied to this curve it would give , which is impossible. So no constant smaller than works, and [A1] is false.
Remarks
-
The two witnesses on this page say opposite-looking things and are consistent. on : no satisfies shows that the equality form of the mean value theorem fails for : there need be no with . The present item shows that the inequality of The mean value inequality: if is continuous and differentiable on with , then is nevertheless sharp. Together they say that the correct vector-valued statement is an inequality, and that it is the best inequality of its shape.
-
Why the equality is attained here and not there. On the curve above the derivative is constant, so it points in one direction and the displacement accumulates with no cancellation. On the direction of turns as increases, and the displacement is strictly shorter than the length the bound allows: there while the bound is .
-
The curve is as simple as it can be. Its image is a segment of the first coordinate axis, and the second component is present only so that the codomain is rather than ; the same computation in for any gives the same equality.
The comparison constants between , and on , and vectors attaining each
Example
On with the norms of The -norms for rational , and , the comparison chain of The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for clause 3 reads
Each of these four constants is attained, so none can be improved:
- has , so the first and second inequalities are equalities there;
- has , and , so the third and fourth inequalities are equalities there.
The general theorem For all norms on are equivalent supplies constants but no attaining vectors; that is what this computation adds.
Unit balls. Writing for , the chain gives , and both inclusions are strict: lies in and not in , and lies in and not in . The scalar has to be chosen strictly between and : at the endpoint the vector has and so still lies in .
Facts & Assumptions
Given: The space with , and (The -norms for rational , and , Laws of finite sums and finite products, Finite sums and finite products, by recursion, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set); the vectors , and (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
The comparison chain on for , at : and (The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for clause 3, The Cauchy-Schwarz inequality for finite sums).
Each of the three is a norm and induces the correspondingly named published metric (Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page, 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, Open ball, closed ball and sphere in a metric space).
Square roots: is the unique nonnegative with , so , and squaring is strictly monotone on the nonnegatives (Square roots exist: a unique with ; the positives are , Squaring is monotone on the nonnegatives).
Canonical naturals: , , , and is strictly increasing (The canonical natural of a field, Canonical naturals are positive and strictly increasing).
Absolute value: , , (Absolute value in an ordered field, Basic properties of the absolute value).
Verification
, , and .
, , and .
The inclusions follow from the chain: gives , and that gives .
At the first inequality of [L1] reads and the second reads : both are equalities, so neither nor can be improved by a constant smaller than .
At the third inequality of [L1] reads and the fourth reads : both are equalities, so the constants and are best possible.
The inclusions are strict: has and since , so ; and has while satisfies , so .
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.
Remarks
-
Sharpness is not the same as equivalence. For all norms on 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 .
-
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 is largest relative to the other two. On the same two vectors give equality with and in place of and ; only the case is verified here.
-
The strictness computation in step 2.3 is arithmetic, not geometry. The scalar was chosen to lie strictly between and ; any scalar in that open interval would serve, and the interval is nonempty exactly because .
on violates the parallelogram law, so no symmetric bilinear form induces it
Statement refuted
Refuted claim: every norm on arises from a symmetric bilinear form, that is, for every norm there is a function that is symmetric and additive and homogeneous in each argument, with for every .
The witness is on (The -norms for rational , and ), and the obstruction is the parallelogram law, which every such satisfies (Cauchy-Schwarz with its equality case, the triangle inequality for , 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 fails at , .
What is and is not claimed. What is refuted is the displayed claim, whose hypothesis is a symmetric bilinear form on 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; nor is any abstract theory of inner product spaces, which belongs to a page of this library earlier in the plan order that is not yet built (Conventions of this page, the standing hypothesis, and what is taken up elsewhere in the reading order).
Facts & Assumptions
Given: The space with (The -norms for rational , and ) and the standard basis vectors , (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
The refuted claim at : there is a symmetric , additive and homogeneous in each argument, with for every .
Absolute values: and (Absolute value in an ordered field, Basic properties of the absolute value).
Square roots: is the unique nonnegative with , so whenever (Square roots exist: a unique with ; the positives are , Integer powers ).
Canonical naturals are strictly increasing and positive and carry sums to sums and products to products, so , , and (The canonical natural of a field, Canonical naturals are positive and strictly increasing).
The Euclidean inner product is bilinear and symmetric and satisfies the parallelogram law for (The Euclidean inner product on , Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation clause 3).
Counterexample
Assume [A1] and write , so for every .
By symmetry and additivity and homogeneity in each argument, and , hence for all .
Computing: and , while .
Instantiate step 1.2 at , : the left side is and the right side is .
So the left side of step 2.1 is and the right side is , giving , which contradicts the strict increase of .
Hence [A1] is false: no symmetric bilinear form on induces , and in particular .
The parallelogram law does hold for , 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.
Remarks
-
Equivalence of norms says nothing about inner products. By For all norms on are equivalent the norms and on 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 for any symmetric bilinear . 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 , and the arithmetic is . 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 with its equality case, the triangle inequality for , 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.
, extended by , is continuous in each variable separately and not continuous at the origin
Statement refuted
Refuted claim: a function that is continuous in each variable separately — that is, for which and are continuous on for every fixed and (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point) — is continuous as a map (Vector-valued functions , 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, as the set of functions , and , , are metrics on it).
The witness. Define by
writing for an element of , the set of functions ( as the set of functions , and , , are metrics on it). The quotient is defined for because there (The Euclidean inner product on , A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).
Then is continuous in each variable separately at every point, and is not continuous at .
This is the first function on whose continuity this library studies, and its domain is with the published metric , not an informal plane.
Facts & Assumptions
Given: The function above; the sequence in (Sequences of reals: bounded, eventually, frequently, tails, subsequences, The canonical natural of a field).
The refuted claim, at this : separate continuity everywhere implies continuity as a map .
Continuity of a real-valued function on a metric space, and the sequential characterisation: is continuous at if and only if whenever (Vector-valued functions , 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, For a map of metric spaces the following agree: - continuity everywhere, preimages of open sets are open, preimages of closed sets are closed, sequential continuity, and clauses (a) and (d), Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded).
Convergence in is componentwise (For a sequence in converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and is complete in every norm clause 1, Convergence of a sequence in a metric space: iff in , Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page, The -norms for rational , and , The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
Algebra of continuous real functions on a subset of : sums, products and quotients with nonvanishing denominator of continuous functions are continuous, and every polynomial function is continuous (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace).
The canonical natural: for every , and for every real there is with (The canonical natural of a field, Canonical naturals are positive and strictly increasing, For every in a complete ordered field there is a natural with , Inverses of positives are positive, and reciprocation reverses order).
Counterexample
For a fixed real the function is a quotient of two polynomial functions of whose denominator never vanishes, since ; so it is continuous on .
For the function is constantly : at its value is , and at it is . A constant function is continuous.
Each coordinate sequence of is , which converges to : given a rational , an index with gives for every . Hence in .
By the symmetry , the same two arguments give continuity of for every fixed real .
For every the point is nonzero, and with its value is .
So is continuous in each variable separately at every point of .
So the constant sequence converges to , while and because .
By the sequential characterisation of continuity, is not continuous at : the sequence has .
Steps 3.1 and 4.1 together refute [A1]: is separately continuous everywhere and is not continuous at the origin.
Remarks
-
What the sequence sees. Along the line the value of is constantly off the origin, and points of that line come arbitrarily close to the origin; along either axis the value is constantly . 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 , their limits and continuity, with the dictionary to the metric notions defines. Nothing here claims that any weaker hypothesis suffices.
-
Nothing is claimed about away from the origin. The refutation needs only the behaviour of at together with the two partial functions, and that is all that is proved. In particular this item does not assert that is continuous at the points , 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.
A convergent sequence in and the integral , computed componentwise
Example
Two parts of the vector-valued toolkit are exercised here, in : componentwise sequence convergence and componentwise integration.
A convergent sequence. For put
with the canonical natural (The canonical natural of a field); the shift by one is there because contains and . Then in .
An integral. Let be . Then is integrable and
The norm inequality is strict here. , while . The exact value of 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 and integrable when , ; for , is integrable.
Facts & Assumptions
Given: The sequence and the function above; the abbreviation (The -norms for rational , and , The Euclidean inner product on ).
Convergence in for is componentwise (For a sequence in converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and is complete in every norm clause 1, Convergence of a sequence in a metric space: iff in , Sequences of reals: bounded, eventually, frequently, tails, subsequences, The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
The vector-valued integral is componentwise, and is integrable exactly when each is (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral, The integral with oriented limits: and , Intervals of : the nine order-convex forms, nondegeneracy, and length).
A continuous function on is integrable, and for any primitive of a continuous (A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion, Every continuous function on an interval has a primitive; two primitives differ by a constant; and for any primitive ); polynomial functions are continuous (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function) and has derivative for (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, Integer powers ).
Monotonicity and linearity of the integral (If on and both are integrable then ; and , Integrable functions on form a set closed under sums and scalar multiples, and , Laws of finite sums and finite products, Finite sums and finite products, by recursion).
Square roots and squaring: is the unique nonnegative with , and for , exactly when (Square roots exist: a unique with ; the positives are , Squaring is monotone on the nonnegatives).
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 of a field).
Continuity of a vector-valued function is componentwise (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 clause 1, Vector-valued functions , their limits and continuity, with the dictionary to the metric notions).
Verification
The three coordinate sequences of are , and the constant . Given a real , take with ; then for one has , so the first converges to , the second to and the third to .
Each component of is a polynomial function, hence continuous on and integrable there; so is integrable, and is continuous.
The function is a primitive of for , so ; at this gives , and .
For put , so and . Since exactly when , that is exactly when , and both and are nonnegative, monotonicity of squaring gives .
Finally , since cross-multiplying by the positive turns the claim into , which holds because is strictly increasing.
Hence in , the for the vector being obtained from the three coordinate tolerances exactly as in the proof of [L1].
Therefore , the coordinates of the vector integral being the integrals of the coordinates.
The right-hand side of step 1.4 is continuous, hence integrable, and by step 1.3 and linearity .
Its Euclidean norm satisfies , so , since and both numbers are nonnegative.
By monotonicity of the integral, using that is integrable, .
So : the inequality of [L6] holds on this example and is strict.
Remarks
-
Why the inequality is strict here. Equality in For and integrable when , ; for , is integrable would require the integrand to point in a fixed direction, and changes direction as runs over . That heuristic is not what is proved above: the proof separates the two sides by an explicit numerical bound, which is the only argument available at this point in the reading order.
-
The lower bound is deliberately crude. The inequality used in step 1.4 holds for and is far from sharp; it is chosen because it is polynomial, so that step 2.3 is an application of Every continuous function on an interval has a primitive; two primitives differ by a constant; and for any primitive and nothing more. The exact value of is not a value this page can name.
-
The sequence and the integral are independent computations, put in one item because they exercise componentwise arguments on the same space. Neither uses the other.
Steinitz's confinement bound realised on an explicit list of six unit vectors in summing to zero
Example
Take and , and let , so that has . Define by
with and (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ). Every is and , so Steinitz's polygonal confinement theorem: finitely many vectors of norm at most summing to can be ordered so that every partial sum has norm at most applies and asserts an ordering all of whose partial sums have norm at most .
A good ordering. The identity ordering works: the partial sums are
with norms , , , , , , , each at most .
A bad ordering, which exceeds the bound. Reordering as gives the third partial sum , whose norm squared is . So that ordering has a partial sum of norm strictly greater than , and the theorem is saying something.
One step of the descending construction. With the identity of and for , the pair is admissible at in the sense of the proof of Steinitz's polygonal confinement theorem: finitely many vectors of norm at most summing to can be ordered so that every partial sum has norm at most . At the next stage the feasible set is
and lies in it with exactly two coordinates strictly between and , which is the least possible. Its support is , of size , so the support bound holds with room; dropping the coordinate gives the admissible pair at with and .
Facts & Assumptions
Given: The list above, with and ; the partial sums of the identity ordering; the vector .
Square roots: is the unique nonnegative with ; ; and for , exactly when (Square roots exist: a unique with ; the positives are , Squaring is monotone on the nonnegatives, Integer powers ).
Canonical naturals are positive and strictly increasing and carry sums to sums and products to products (The canonical natural of a field, Canonical naturals are positive and strictly increasing); inverses of positives are positive (Inverses of positives are positive, and reciprocation reverses order).
Finite sums in are computed pointwise, with the recursion (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension clause 1, Linear combination of a finite list, and the span as the smallest linear subspace containing , Laws of finite sums and finite products, Finite sums and finite products, by recursion).
Steinitz's polygonal confinement theorem, its notion of an admissible pair, and its support bound (Steinitz's polygonal confinement theorem: finitely many vectors of norm at most summing to can be ordered so that every partial sum has norm at most , Injection, surjection, bijection).
Verification
by [L2], so and ; also and . Hence for every .
, computing coordinatewise.
For the ordering the third partial sum is , whose norm squared is , using .
The vector lies in : its values lie in ; ; and .
The partial sums of the identity ordering are as displayed, by the recursion of [L4] applied coordinatewise.
Since and , the quantity of step 1.3 exceeds , so that partial sum has norm strictly greater than : a bad ordering really does break the bound.
The pair with the identity of and is admissible at : the values lie in , , and .
No element of has fewer than two strictly fractional coordinates. If none were fractional, would be a -vector with , hence with support of size , and ; the support cannot contain a pair , or , since the remaining single vector would then have to be while all six are nonzero, so it contains exactly one index from each pair and the sum is , whose second coordinate is and whose first is , and because (indeed ). If exactly one coordinate were fractional, say with value , then would be plus a canonical natural and could not equal .
Their norms squared are , , , , , and .
So of step 1.4 is a minimiser, its support is of size , and at : the support bound of [L5] holds, and a coordinate with value exists, for instance .
Each of these is at most : the largest is , and because . So every partial sum of the identity ordering has norm at most , and the identity ordering realises the bound of [L5].
Deleting position gives and , with and : an admissible pair at .
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.
Remarks
-
The bound is not attained here. The largest partial-sum norm of the good ordering is , comfortably below . The theorem asserts existence of an ordering below 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 : the third partial sum of the bad ordering already exceeds , and lists of many unit vectors summing to can be ordered so that a partial sum has norm of order .
-
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 that the descending construction turns on.
A convergent series in with a line and a line, computed from the definition
Example
Let be the alternating sequence, the unique sequence of reals with and , so for every (The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and ). In put
with the canonical natural (The canonical natural 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:
- converges, to where is the sum of the alternating harmonic series; the value of is not computed here, being a logarithm and outside this page's reach.
- does not converge absolutely (Series of vectors in , absolute convergence, rearrangement, and the set of rearrangement sums).
- , the line of multiples of , and , the line of multiples of (The subspace of directions along which a series converges absolutely, and its orthogonal complement ).
- Consequently The set of rearrangement sums of a convergent series in is a nonempty subset of the affine subspace confines every rearrangement sum to the horizontal line ; and for this series the confinement is exact, , by the published The Riemann series theorem: a conditionally convergent real series has, for every , a rearrangement with sum , and rearrangements diverging to , to , and oscillating with any prescribed in 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 for a series genuinely spread over with , a question this library does not settle (Conventions of this page, the standing hypothesis, and what is taken up elsewhere in the reading order).
Facts & Assumptions
Given: The sequence above, its first coordinate sequence and the sequence .
and is strictly increasing; gives ; and for every real there is with (The canonical natural of a field, Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order, For every in a complete ordered field there is a natural with ).
The alternating series test: a nonincreasing null sequence makes converge (The alternating series test: if is nonincreasing with then converges, the sum lies between any two consecutive partial sums, and the error after terms is at most , Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences, Limits and Cauchy sequences of reals, Series, partial sums, convergence and the sum, divergence, and the tail series).
The -series theorem: converges if and only if ; at the harmonic series diverges (For rational , converges iff , Rational powers of a positive base, Series, partial sums, convergence and the sum, divergence, and the tail series).
Convergence in is componentwise (For a sequence in converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and is complete in every norm clause 1, Series of vectors in , absolute convergence, rearrangement, and the set of rearrangement sums, The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
The inner product, the Euclidean norm and the definition of and (The Euclidean inner product on , The -norms for rational , and , A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, The subspace of directions along which a series converges absolutely, and its orthogonal complement , Square roots exist: a unique with ; the positives are , Integer powers ).
For , converges if and only if converges (Convergent series add and scale termwise clause 3).
The containment theorem (The set of rearrangement sums of a convergent series in is a nonempty subset of the affine subspace ) and the Riemann series theorem: a conditionally convergent real series has, for every real , a rearrangement converging to (The Riemann series theorem: a conditionally convergent real series has, for every , a rearrangement with sum , and rearrangements diverging to , to , and oscillating with any prescribed in clause 1, Absolutely convergent and conditionally convergent series, and the general starting index, Injection, surjection, bijection).
Verification
is positive, nonincreasing and converges to : positivity and monotonicity from , and convergence because for a rational an index with gives for .
The second coordinate sequence is constantly , so its series converges with sum .
By the alternating series test converges; write for its sum.
, and is the harmonic series, which diverges; so does not converge absolutely, which is clause 2.
By componentwise convergence, converges with sum , which is clause 1.
For : , so . If every term is and the series converges; if then and convergence of would give convergence of , which is false.
Conversely let . The real series 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 with . The rearranged vector series has first coordinate series and second coordinate series constantly , so by componentwise convergence it converges to ; hence .
Hence , the set of scalar multiples of .
For : means for every real , which at forces , and conversely makes every such product . So , the set of scalar multiples of , and clause 3 is proved.
By the containment theorem, .
Steps 6.1 and 3.3 give , which is clause 4.
Remarks
-
Why this example is degenerate, and why that is said out loud. Every term lies in the line , so the whole series lives there and its rearrangement theory is the theory of the real series . The equality in clause 4 is therefore the published The Riemann series theorem: a conditionally convergent real series has, for every , a rearrangement with sum , and rearrangements diverging to , to , and oscillating with any prescribed in wearing two coordinates, not a higher-dimensional phenomenon. Nothing here supports or contradicts any statement about a series whose terms span .
-
The divergence of the harmonic series may be had two ways. Step 2.2 uses For rational , converges iff at ; the Cauchy condensation test gives the same conclusion, and either citation would do.
-
What the example makes concrete. is computed from its definition, one direction at a time, and turns out to be the set of directions orthogonal to where the series actually moves: testing against sees only zeros, and testing against sees the alternating harmonic series, which is not absolutely summable. That is exactly the dichotomy The subspace of directions along which a series converges absolutely, and its orthogonal complement is built to record.
FALSE: if a convergent series in does not converge absolutely, then every point of is the sum of some rearrangement of it
Statement
False claim: let and let be a sequence in whose series converges but does not converge absolutely (Series of vectors in , absolute convergence, rearrangement, and the set of rearrangement sums). Then every point of is the sum of some rearrangement of ; that is, .
Where the claim comes from. For it is true, and it is the published The Riemann series theorem: a conditionally convergent real series has, for every , a rearrangement with sum , and rearrangements diverging to , to , and oscillating with any prescribed in : a conditionally convergent real series can be rearranged to any prescribed sum. The claim above is the naive transfer of that theorem to by analogy, and the analogy fails at already.
The witness is the series of A convergent series in with a line and a line, computed from the definition: in , which converges, does not converge absolutely, and has no rearrangement sum off the horizontal axis. In particular is not a rearrangement sum.
Facts & Assumptions
Given: The sequence in of A convergent series in with a line and a line, computed from the definition, with and .
The refuted claim, instantiated at and this : every point of , in particular , is the sum of some rearrangement of .
The series converges, with sum , and does not converge absolutely, its norms being and the harmonic series divergent (A convergent series in with a line and a line, computed from the definition clauses 1 and 2, For rational , converges iff , Absolutely convergent and conditionally convergent series, and the general starting index, The canonical natural of a field).
A rearrangement of is for a bijection of , and is the set of its sums (Series of vectors in , absolute convergence, rearrangement, and the set of rearrangement sums, Injection, surjection, bijection).
Convergence in is componentwise, partial sums are computed coordinatewise, and a limit in a metric space is unique (For a sequence in converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and is complete in every norm clause 1, The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension clause 1, A sequence in a metric space has at most one limit, Convergence of a sequence in a metric space: iff in , Laws of finite sums and finite products, Finite sums and finite products, by recursion).
The containment theorem: , and for this series is the set of multiples of (The set of rearrangement sums of a convergent series in is a nonempty subset of the affine subspace , The subspace of directions along which a series converges absolutely, and its orthogonal complement , A convergent series in with a line and a line, computed from the definition clause 3, Linear subspace of a vector space, The Euclidean inner product on , The -norms for rational , and , A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).
Refutation
The second coordinate of every term is , so for every bijection of the second coordinate of every partial sum is the finite sum of zeros, namely .
The hypotheses of the refuted claim are met by this series: it converges and does not converge absolutely.
If a rearrangement converges to a point , then by componentwise convergence its second coordinate sequence, constantly by step 1.1, converges to ; a constant sequence converges to its value and limits are unique, so .
Hence every element of has second coordinate , and , whose second coordinate is , is not a rearrangement sum.
So [A1] fails for a series satisfying the hypotheses of the refuted claim, and the claim is false.
The failure is structural rather than accidental: by the containment theorem every rearrangement sum lies in , and here is a line in , hence a proper subset, so cannot be all of whatever else is true of it.
Remarks
-
The refutation uses only the containment half. Step 2.1 is an elementary argument about the second coordinate and needs nothing beyond componentwise convergence; step 5.1 explains it through The set of rearrangement sums of a convergent series in is a nonempty subset of the affine subspace , which proves and nothing more. No statement about the reverse inclusion is used here, and none is asserted.
-
Why is genuinely different. For a conditionally convergent real series , so is the whole line and the containment says nothing; the space simply has no proper subspace for the rearrangement sums to be trapped in other than . From on there is room, and this witness uses it.
-
What a correct general statement would have to look like. The affine subspace is an upper bound for , and the two extremes are both realised: it is a single point when the series converges absolutely (An absolutely convergent series in converges, and every rearrangement converges to the same sum), and it is the whole line in the one-dimensional conditionally convergent case (The Riemann series theorem: a conditionally convergent real series has, for every , a rearrangement with sum , and rearrangements diverging to , to , and oscillating with any prescribed in ). What happens between those extremes for is not settled in this library, and the present item settles only that "everything" is the wrong answer.
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 with a natural number, which is For all norms on are equivalent. Dropping the hypothesis that the space is one of the makes the claim false, and the witness below is built from published material only.
The witness. Let be the function space of all functions with pointwise operations (The vector space of all functions with pointwise operations, and as the case ), and let
be the set of finitely supported sequences. On define
for any with for . Both are norms on , both values are independent of the admissible chosen, and no real satisfies on .
Facts & Assumptions
Given: The space , the subset , the functions and above, and, for , the vector with for and for . For , is the function with and for .
The refuted claim: any two norms on a real vector space are equivalent.
is a vector space over with pointwise operations, and a nonempty with for all and all is a linear subspace, hence itself a vector space (The vector space of all functions with pointwise operations, and as the case , Vector space over a field, Linear subspace of a vector space, One-step subspace test: a nonempty is a linear subspace if and only if for all and ).
Finite sums in a function space are pointwise, for an arbitrary index set: (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension clause 1, stated there for an arbitrary ; Linear combination of a finite list, and the span as the smallest linear subspace containing , Finite sums and finite products, by recursion).
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 , and .
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.
Absolute value (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality): ; exactly when ; ; .
The Archimedean property: for every real there is a natural with (Every complete ordered field is Archimedean, The canonical natural of a field, Canonical naturals are positive and strictly increasing).
Dimension: if has a spanning set with elements then every linearly independent subset of is finite with at most elements; a finite-dimensional space is one with a finite basis (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with , Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent, Finite, countably infinite, countable, uncountable, Equinumerous sets, and , The pigeonhole principle on ).
Norm equivalence: and are equivalent when for some reals (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
is a linear subspace of , hence a real vector space: it contains , and if for and for then for .
The values and do not depend on the admissible . If are both admissible, then splitting the sum gives , and the second part is a sum of zeros; and because the extra entries are and the maximum over is .
The hypothesis that fails is finite-dimensionality. For every the set is a subset of with elements, the map being injective because for ; and it is linearly independent, since for an injective list into it and scalars , evaluating at the point gives , the list vanishing off the single index .
is a norm on . (N1): forces every for , hence ; and . (N2): is admissible with the same and . (N3): with admissible for both and , termwise.
is a norm on . (N1): forces and for every , hence . (N2): , since for every with equality at an index attaining the maximum. (N3): for every , and the maximum on the left is one of those numbers.
For the vector lies in , and is admissible for it; so and .
So has no finite basis: a basis with elements would span , forcing every linearly independent subset to have at most elements, while step 1.3 produces one with . Hence is infinite-dimensional, and For all norms on are equivalent, which is a statement about for a natural , does not apply to it.
Suppose and were equivalent, so that in particular for every and some real . Then for every , by step 2.3.
That contradicts the Archimedean property, which supplies a natural with . So and are not equivalent, and [A1] is false.
The claim [A1] is therefore false, and the true statement in its neighbourhood is For all norms on are equivalent, whose proof spends compactness of the Euclidean unit sphere, a property step 2.4 shows has no analogue of.
Remarks
-
No classification of infinite-dimensional normed spaces is claimed here. What is exhibited is one real vector space carrying two inequivalent norms, which is all that is needed to refute the claim.
-
Where the proof of For all norms on are equivalent breaks on . That proof takes the unit sphere of , which is closed and bounded, and concludes compactness from Heine-Borel in : with the Euclidean metric a subset of 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 — a theorem about for a natural , proved by bisecting finitely many coordinates. On there is no such theorem, and indeed FALSE: in every normed space a closed bounded set is compact refutes the corresponding claim on the same space.
-
The two norms are the honest analogues of and , and the ratio at is exactly , the same constant that appears in the comparison chain of The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for on . In finite dimensions that constant is a bound; on it grows without bound, and the Archimedean property is what turns that into a refutation.
FALSE: in every normed space a closed bounded set is compact
Statement
False claim: in every normed space (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 with the Euclidean norm and a natural number, which is Heine-Borel in : with the Euclidean metric a subset of 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 all norms on are equivalent may well expect it to.
The witness is the space of finitely supported real sequences with the norm , both as in FALSE: all norms on a real vector space are equivalent, and the closed unit ball
is closed in and bounded, and it is not compact: the vectors all lie in it and satisfy for .
Facts & Assumptions
Given: The vector space of finitely supported sequences and the norm on it, with induced metric ; the set above; and the vectors with and for .
The refuted claim, at and : is compact.
is a real vector space and is a norm on it, with for any admissible (FALSE: all norms on a real vector space are equivalent, The vector space of all functions with pointwise operations, and as the case , Vector space over a field, Linear subspace of a vector space, One-step subspace test: a nonempty is a linear subspace if and only if for all and , Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).
A norm induces a metric , and (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for clause 1, which is stated for a norm on an arbitrary real vector space; Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Open and closed sets, balls, and boundedness (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, Open ball, closed ball and sphere in a metric space, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
In ZF a compact metric space is sequentially compact (In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle, Countably compact, sequentially compact and limit point compact metric spaces), and a compact subset is one whose metric subspace is compact (Open cover, subcover, compact metric space, and compact subset of a metric space, Isometry, isometric embedding, and the subspace metric on a subset); the five-way equivalence For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice is not needed and is not used.
Every convergent sequence in a metric space is Cauchy (Every convergent sequence in a metric space is Cauchy, Cauchy sequence in a metric space, Convergence of a sequence in a metric space: iff in , Sequences of reals: bounded, eventually, frequently, tails, subsequences); a subsequence is indexed by a strictly increasing map, which is injective (A strictly increasing index map satisfies , Injection, surjection, bijection).
Pigeonhole: there is no injection from into , hence none from into any natural number (The pigeonhole principle on claims 1 and 4, Finite, countably infinite, countable, uncountable).
Absolute value (Absolute value in an ordered field, Basic properties of the absolute value) and the pointwise description of (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
A compact metric space is totally bounded (A compact metric space is complete and totally bounded, and neither implication uses any choice principle, Finite -net and totally bounded metric space).
Refutation
Each lies in , with admissible, and ; so for every .
For the vector has coordinates at , at and elsewhere, so , that is .
is bounded, since : gives .
is closed in . Let , so , and put ; if then , so . Hence the complement of is open.
No subsequence of is Cauchy in : if were, with strictly increasing and hence injective, then taking the tolerance would give indices with , while and step 1.2 make that distance .
Hence no subsequence of converges in the metric subspace , a convergent sequence being Cauchy and being the restriction of ; so is not sequentially compact.
If were compact then 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 is closed and bounded and not compact.
The same family shows that is not totally bounded, which is the property the general characterisation identifies as missing. Suppose were a finite -net. Assigning to each the least with gives a map , which cannot be injective by pigeonhole; so there are and one with and , whence , contradicting step 1.2.
Remarks
-
What is refuted and what is not. The claim refuted is the transfer of Heine-Borel in : with the Euclidean metric a subset of 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 to arbitrary normed spaces. No general classification of normed spaces is asserted here; in particular the classical converse, that a normed space whose closed unit ball is compact must be finite-dimensional, is not proved anywhere here.
-
Why the linear structure does not help. The bisection proof of Heine-Borel in : with the Euclidean metric a subset of 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 halves one coordinate at a time and terminates because there are finitely many coordinates. On there are infinitely many, and the standard unit vectors stay a fixed distance apart no matter how far out one looks; that is exactly the failure of total boundedness in step 5.1.
-
The relation to the published metric-space version. FALSE: a closed and bounded subset of a metric space is compact refutes the claim for metric spaces, and its witness is carrying the metric that assigns distance to distinct points — a set with no linear structure at all. The present item refutes the narrower claim about normed spaces, on a space that is a linear subspace of a function space and carries a genuine norm, so no reader can retreat to "the counterexample was not linear".
-
No choice principle is used. Step 4.1 quotes only the ZF implication In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle, and step 5.1 quotes A compact metric space is complete and totally bounded, and neither implication uses any choice principle, also a theorem of ZF; the equivalence For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice, which carries two choice hypotheses, is deliberately avoided.
FALSE: a sequence in whose coordinate sequences are each bounded converges
Statement
False claim: let and let be a sequence in such that every coordinate sequence is bounded (Sequences of reals: bounded, eventually, frequently, tails, subsequences). Then converges in (Convergence of a sequence in a metric space: iff in , as the set of functions , and , , are metrics on it).
The claim conflates two theorems. What is true about boundedness is For every bounded sequence in has a convergent subsequence: a bounded sequence has a convergent subsequence. What is true componentwise is For a sequence in converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and 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 and let be the function with value at , where is the alternating sequence (The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and ).
Facts & Assumptions
Given: The alternating sequence , with , and ; its even and odd index maps and , strictly increasing with and for every (The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and ); and the sequence with .
The refuted claim, at and this sequence: converges in .
The alternating sequence and its index maps, and (The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and , Basic properties of the absolute value, A strictly increasing index map satisfies ).
Convergence in for is componentwise (For a sequence in converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and is complete in every norm clause 1, The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension , The -norms for rational , and , Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page, The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for ).
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).
A constant real sequence converges to its value (Limits and Cauchy sequences of reals).
A bounded sequence in has a convergent subsequence (For every bounded sequence in has a convergent subsequence, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Isometry, isometric embedding, and the subspace metric on a subset); and a convergent real sequence is bounded (Every convergent sequence is bounded).
Refutation
The only coordinate sequence of is , and it is bounded: for every , so works. So the hypothesis of the refuted claim is met.
The subsequence is constantly and converges to ; the subsequence is constantly and converges to ; both index maps are strictly increasing.
The real sequence does not converge: if it converged to , both subsequences of step 1.2 would converge to , so and by uniqueness of limits, contradicting .
By the componentwise criterion, converges in if and only if converges in ; by step 2.1 it does not. So [A1] fails while the hypothesis holds, and the claim is false.
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.
Remarks
-
The same witness separates the two notions on the real line. Boundedness of a real sequence gives a convergent subsequence and nothing more, and the alternating sequence has limit inferior and limit superior , so by A real sequence converges to iff , and diverges to iff both equal it cannot converge. That is a second route to step 2.1; the one taken above uses only uniqueness of limits.
-
Componentwise boundedness and boundedness agree, so nothing is gained by weakening the hypothesis. For the comparison chain (The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for clause 3) shows that a sequence in has bounded range if and only if every coordinate sequence is bounded. So the refuted claim is exactly the claim that a bounded sequence converges, restated coordinatewise.
-
The converse direction is fine. A convergent sequence in does have bounded coordinate sequences, each coordinate sequence being convergent by For a sequence in converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and is complete in every norm clause 1 and a convergent real sequence being bounded (Every convergent sequence is bounded). Only the direction asserted above fails.
Sources
Standard references
Recommended treatments; not extraction sources.
- Mean value theorem (Wikipedia)
- Vector-valued function (Wikipedia)
- J. Lebl, Basic Analysis I, Section 8.4
- Lp space (Wikipedia)
- Norm (mathematics) (Wikipedia)
- J. Demmel, MA221 Lecture 3: Vector Norms
- G. Zitelli, Math 641 Functional Analysis, Part I
- Parallelogram law (Wikipedia)
- Princeton MAT520 Functional Analysis Lecture Notes
- Continuous function (Wikipedia)
- Multivariable calculus (Wikipedia)
- Harvard Math 21a, separately continuous but not jointly continuous example
- Riemann integral (Wikipedia)
- J. Lebl, Basic Analysis I, Section 7.3
- APEX Calculus, Section 12.2
- Levy-Steinitz theorem (Wikipedia)
- Ernst Steinitz (Wikipedia)
- T. Oertel, J. Paat and R. Weismantel, A Colorful Steinitz Lemma with Applications to Block Integer Programs
- T. Banakh, A Simple Inductive Proof of the Levy-Steinitz Theorem
- Riemann series theorem (Wikipedia)
- Archimedean property (Wikipedia)
- Heine-Borel theorem (Wikipedia)
- Riesz's lemma (Wikipedia)
- Bolzano-Weierstrass theorem (Wikipedia)
- Limit of a sequence (Wikipedia)