Cube-summable families form a vector space on which the lattice sum is linear; a nonnegative family is cube-summable exactly when its cube sums are bounded, its sum is their supremum and agrees with its series along any enumeration; absolute cube-summability and domination imply cube-summability; finitely supported families are summable.
2. (Nonnegative families) Suppose 0≤a(k) for every k∈Zn. Then SN(a)≤SM(a) whenever N≤M, and a is cube-summable if and only if the set {SN(a):N∈N} is bounded above; in that case ∑k∈Zna(k) is the supremum of that set, 0≤∑k∈Zna(k), and ∑k∈Ea(k)≤∑k∈Zna(k) for every nonempty finite set E⊆Zn.
3. (Enumerations) Suppose 0≤a(k) for every k∈Zn, and let κ:N→Zn be a bijection. Then the series∑j=1∞a(κ(j)) converges if and only if a is cube-summable, and in that case
j=1∑∞a(κ(j))=k∈Zn∑a(k).
4. (Absolute summability) If ∣a∣ is cube-summable, then a is cube-summable and ∑k∈Zna(k)≤∑k∈Zn∣a(k)∣.
5. (Comparison) If b is cube-summable and ∣a(k)∣≤b(k) for every k∈Zn, then ∣a∣ and a are cube-summable and ∑k∈Zn∣a(k)∣≤∑k∈Znb(k).
6. (Finitely supported families) If E⊆Zn is a nonempty finite set and a(k)=0 for every k∈/E, then a is cube-summable, SN(a)=∑k∈Ea(k) for every N with E⊆ΓN, and ∑k∈Zna(k)=∑k∈Ea(k).
Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.