Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

Series of vectors in Rn, absolute convergence, rearrangement, and the set of rearrangement sums

Definition

Let n∈N with n≥1, so that Rn carries the Euclidean metric d2 (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, Each ∥⋅∥p is a norm on Rn, and the induced metrics are exactly d1, d2 and d∞ of the published metric-spaces page). A sequence of vectors is a function x:N→Rn, written (xk) with xk:=x(k); as everywhere in this library N contains 0 and a sequence is indexed from 0 (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R).

Partial sums and convergence

The partial sums of (xk) are

sN  :=  ∑k<Nxk  ∈  Rn(N∈N),

the finite sum of the vector space Rn (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S), so s0=0 and sN+1=sN+xN. No third notion of finite sum is introduced: by 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 clause 1 the vector sum is computed pointwise, (sN)(j)=∑k<Nxk(j) for j<n, the right-hand side being the real finite sum of Finite sums and finite products, by recursion.

The series ∑xk converges to s∈Rn when sN→s in (Rn,d2) (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R), and then s is the sum, written ∑k=0∞xk. The symbol denotes a single vector, because a sequence in a metric space has at most one limit (A sequence in a metric space has at most one limit). The series diverges when (sN) does not converge.

Absolute convergence

∑xk converges absolutely when the real series ∑∥xk∥2 converges (Series, partial sums, convergence and the sum, divergence, and the tail series); since ∥xk∥2≥0 (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms), this is a statement about a series of nonnegative terms, exactly as in Absolutely convergent and conditionally convergent series, and the general starting index.

The choice of norm is immaterial. If N is any norm on Rn then c∥xk∥2≤N(xk)≤C∥xk∥2 for fixed c,C>0 (For n≥1 all norms on Rn are equivalent, Equivalent norms, and the dictionary with equivalent metrics), so ∑N(xk) converges exactly when ∑∥xk∥2 does, both being series of nonnegative terms. The notion defined above therefore depends on Rn and not on the norm chosen to test it.

Rearrangement and the set of rearrangement sums

Let σ:N→N be a bijection (Injection, surjection, bijection). The rearrangement of ∑xk along σ is the series ∑xσ(k) of the sequence k↦xσ(k), verbatim as in Rearrangement of a series along a bijection of N, and unconditional convergence one dimension down. The set of rearrangement sums of (xk) is

S(x)  :=  { s∈Rn  :  some rearrangement of ∑xk converges to s }.

Taking σ to be the identity shows that a convergent ∑xk has its own sum in S(x), so S(x)≠∅ for a convergent series.

Agreement with the one-dimensional theory

R1 is the set of functions 1→R and is not literally R. The map θ:R→R1 sending t to the function with value t at 0 is a bijection; it preserves addition and scalar multiplication, since both are computed pointwise (Vector space over a field, 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), and d2(θ(s),θ(t))=∣s−t∣, so it is an isometric bijection (Isometry, isometric embedding, and the subspace metric on a subset). Under that identification, and for n=1:

Every comparison on this page between Rn and the published one-dimensional theory goes through this identification, and it is stated each time.

Remarks

Depends on

Used by

Dependency tree · two levels

109 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources