Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Square-summable families on an arbitrary index set and the space ℓ2(I)

Definition

Throughout, F is R or C and families are indexed by an arbitrary set I, with no enumeration or countability assumed. Finite real lists use Finite sums and finite products, by recursion, and sums over finite subsets use A finite sum in a commutative monoid indexed by an arbitrary finite set in the additive monoid of the scalar field. Disjoint splitting is Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule, and scalar modulus estimates use Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive; all suprema and infima of real sets below are taken in the complete ordered field R (Complete ordered field (least-upper-bound property)) or in [0,+∞]⊆R‾ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R).

Sums of nonnegative families. Let (ci)i∈I be a family of nonnegative reals and let Fin⁡(I) be the set of finite subsets of I, ordered by inclusion. Define

∑i∈Ici:=sup⁡{∑i∈Fci  :  F∈Fin⁡(I)}∈[0,+∞].

The set of finite subsums is nonempty, since ∅ contributes the empty sum 0, so the supremum exists in [0,+∞]; it is a real number exactly when the finite subsums are bounded above in R, and +∞ otherwise. For finite I the finite subsum at I is the largest of all finite subsums, because all terms are nonnegative, so the definition agrees with the finite sum; in particular ∑i∈Ici=0 when every ci is 0, and I=∅ gives the empty sum 0.

Splitting identity and small tails. Fix a finite F⊆I. Every finite G⊆I splits as the disjoint union (G∩F)∪(G∖F), so ∑i∈Gci=∑i∈G∩Fci+∑i∈G∖Fci≤∑i∈Fci+∑i∈I∖Fci; conversely the finite G with F⊆G satisfy ∑i∈Gci=∑i∈Fci+∑i∈G∖Fci. Taking suprema, with the constant ∑i∈Fci passing through the supremum,

∑i∈Ici=∑i∈Fci+∑i∈I∖Fci.(1)

Consequently, if S:=∑i∈Ici is finite, then for every real ε>0 there is a finite F⊆I with ∑i∈I∖Fci<ε: the finite subsums form a nonempty bounded-above set with supremum S, so by the epsilon characterisation of the supremum (Epsilon characterisation of the supremum) some finite F has S−ε<∑i∈Fci, and (1) gives ∑i∈I∖Fci=S−∑i∈Fci<ε. Such an F is called a tail-control set for ε.

Sums of scalar families. Now let (ai)i∈I be a family in F and put sF:=∑i∈Fai for finite F⊆I. The set Fin⁡(I) with inclusion is a directed preorder: it is nonempty and F∪G is a common upper bound of F and G (Directed preorders and nets). Hence (sF)F∈Fin⁡(I) is a net in F, the finite-subset net of the family, and the family is summable when this net converges (Convergence and cluster points of a net in a topological space). The scalar metric is the usual real metric or The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane. These metric spaces are Hausdorff by Distinct points of a metric space have disjoint balls around them. A net in F has at most one limit (A topological space is Hausdorff if and only if every net has at most one limit), so for a summable family the limit is unique and we write ∑i∈Iai:=lim⁡FsF for it. The family is absolutely summable when ∑i∈I∣ai∣<+∞ in the sense above.

Every absolutely summable family is summable, in ZF. Assume S:=∑i∈I∣ai∣ is finite and put SF:=∑i∈F∣ai∣ for finite F. For finite F,G⊆I the triangle inequality for finite sums and the fact that a finite subsum is at most the whole nonnegative sum give

∣sF−sG∣≤∑i∈F△G∣ai∣≤S−SF∩G.(2)

Now fix a real ε>0, let F0 be a tail-control set for ε, and let F,G⊇F0 be finite. Then F∩G⊇F0, so S−SF∩G≤S−SF0<ε and (2) gives ∣sF−sG∣<ε.

First suppose F=R. For each finite F define AF:=inf⁡{sG:G⊇F} and BF:=sup⁡{sG:G⊇F} over finite G. Both are real numbers, because ∣sG∣≤SG≤S, so the two sets are nonempty and bounded, and AF≤BF. If H⊇F then AH≥AF and BH≤BF. Let L:=sup⁡FAF and U:=inf⁡FBF. Since AF≤sF∪H≤BH for all finite F,H, we get L≤U. Moreover, the preceding estimate holds for every pair F,G⊇F0; taking the supremum over F and the infimum over G gives BF0−AF0≤ε. Hence 0≤U−L≤BF0−AF0≤ε for every ε>0, so L=U=:s. If F⊇F0, then both sF and s lie in [AF0,BF0], and therefore ∣sF−s∣≤ε.

If F=C, apply the real argument just proved to the families (Re⁡ai) and (Im⁡ai). They are absolutely summable because ∣Re⁡ai∣,∣Im⁡ai∣≤∣ai∣. Their finite-subset nets converge to real numbers r and t, respectively, so sF→r+it in C. Thus every absolutely summable real or complex family is summable. No choice principle is used: the construction uses only two-sided suprema in R.

Linearity and absolute value. If (ai) and (bi) are absolutely summable and λ∈F, then so are (ai+bi) and (λai), and

∑i∈I(ai+bi)=∑i∈Iai+∑i∈Ibi,∑i∈Iλai=λ∑i∈Iai,∣∑i∈Iai∣≤∑i∈I∣ai∣,

because the corresponding identities hold for every finite subsum, both sides are limits of the corresponding finite-subset nets, and addition, scalar multiplication and the modulus are continuous. The splitting identity (1) likewise passes to absolutely summable scalar families: ∑i∈Iai=∑i∈Fai+∑i∈I∖Fai for every finite F, because finite subsums over sets containing F converge to the left-hand side and equal the finite sum over F plus the finite subsum of the tail, whose net converges to the tail sum.

The finite-dimensional Cauchy-Schwarz inequality. Let (uk)0≤k<m and (vk)0≤k<m be scalar lists, for m∈N and let t∈R. Every term of ∑k<m(∣uk∣−t∣vk∣)2 is nonnegative, so for all real t

0≤∑k<m∣uk∣2−2t∑k<m∣uk∣∣vk∣+t2∑k<m∣vk∣2.

If ∑k<m∣vk∣2>0, substituting t=(∑k<m∣uk∣∣vk∣)/(∑k<m∣vk∣2) gives (∑k<m∣uk∣∣vk∣)2≤(∑k<m∣uk∣2)(∑k<m∣vk∣2); if ∑k<m∣vk∣2=0 then every vk=0 and both sides are 0. In either case ∑k<m∣uk∣∣vk∣≤(∑k<m∣uk∣2)1/2(∑k<m∣vk∣2)1/2 after taking square roots, and applying the modulus inequality for finite sums to ukvk‾ also gives

∣∑k<mukvk‾∣≤(∑k<m∣uk∣2)1/2(∑k<m∣vk∣2)1/2.(3)

The space ℓ2(I). For a family a=(ai)i∈I in F define Q(a):=∑i∈I∣ai∣2. If Q(a) is finite, set ∥a∥2:=Q(a), using the nonnegative real square root of Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}; if Q(a)=+∞, set ∥a∥2:=+∞. This is a case definition, not exponentiation of an extended real. Let

ℓ2(I,F):={ a=(ai)i∈I:∥a∥2<+∞ }.

The set ℓ2(I,F) is a vector space over F: it contains the zero family, is closed under scalar multiplication because ∥λa∥2=∣λ∣ ∥a∥2, and is closed under addition because (3) applied to finite subsums gives ∥a+b∥2≤∥a∥2+∥b∥2<+∞. The same inequality is the triangle inequality for ∥⋅∥2, which is moreover nonnegative, vanishes only for the zero family (an arbitrary sum of nonnegative terms with supremum 0 has every term 0) and satisfies ∥λa∥2=∣λ∣ ∥a∥2; thus ∥⋅∥2 is a norm on ℓ2(I,F). Finally the pairing ⟨a,b⟩:=∑i∈Iaibi‾ is well defined on ℓ2(I,F)×ℓ2(I,F), because ∣aibi‾∣=∣ai∣∣bi∣ has finite nonnegative sum by (3); it is linear in the first variable, conjugate symmetric, positive definite, and satisfies ⟨a,a⟩=∥a∥22, all by the corresponding finite identities and the linearity of the sum. Consequently ℓ2(I,F) is an inner-product space, and ei∈ℓ2(I,F) denotes the family that is 1 at i and 0 elsewhere. Nothing here asserts that ℓ2(I,F) is complete; that follows later, from an orthonormal basis of a Hilbert space.

Depends on

Dependency tree · 2 levels

Sources