Infinite sums and products over ℕ and ℤ #
This file contains lemmas about HasSum, Summable, tsum, HasProd, Multipliable, and tprod
applied to the important special cases where the domain is ℕ or ℤ. For instance, we prove the
formula ∑ i ∈ range k, f i + ∑' i, f (i + k) = ∑' i, f i, ∈ sum_add_tsum_nat_add, as well as
several results relating sums and products on ℕ to sums and products on ℤ.
Sums over ℕ #
If f : ℕ → M has product m, then the partial products ∏ i ∈ range n, f i converge
to m.
If f : ℕ → M has sum m, then the partial sums ∑ i ∈ range n, f i converge
to m.
If f : ℕ → M is multipliable, then the partial products ∏ i ∈ range n, f i converge
to ∏' i, f i.
If f : ℕ → M is summable, then the partial sums ∑ i ∈ range n, f i converge
to ∑' i, f i.
You can compute a product over an encodable type by multiplying over the natural numbers and taking a supremum.
You can compute a sum over an encodable type by summing over the natural numbers and taking a supremum. This is useful for outer measures.
tprod_iSup_decode₂ specialized to the complete lattice of sets.
tsum_iSup_decode₂ specialized to the complete lattice of sets.
Some properties about measure-like functions. These could also be functions defined on complete
sublattices of sets, with the property that they are countably sub-additive.
R will probably be instantiated with (≤) in all applications.
If a function is countably sub-multiplicative then it is sub-multiplicative on countable types
If a function is countably sub-additive then it is sub-additive on countable types
If a function is countably sub-multiplicative then it is sub-multiplicative on finite sets
If a function is countably sub-additive then it is sub-additive on finite sets
If a function is countably sub-multiplicative then it is binary sub-multiplicative
If a function is countably sub-additive then it is binary sub-additive
Alias of Summable.sum_add_tsum_nat_add'.
Alias of Multipliable.prod_mul_tprod_nat_mul'.
Alias of Summable.sum_add_tsum_nat_add.
Alias of Multipliable.prod_mul_tprod_nat_add.
Alias of Summable.tsum_eq_zero_add.
Alias of Multipliable.tprod_eq_zero_mul.
For f : ℕ → G, the product ∏' k, f (k + i) tends to one. This does not require a
multipliability assumption on f, as otherwise all such products are one.
For f : ℕ → G, the sum ∑' k, f (k + i) tends to zero. This does not require a
summability assumption on f, as otherwise all such sums are zero.
Sums over ℤ #
In this section we prove a variety of lemmas relating sums over ℕ to sums over ℤ.
If f₀, f₁, f₂, ... and g₀, g₁, g₂, ... have products a, b respectively, then
the ℤ-indexed sequence: ..., g₂, g₁, g₀, f₀, f₁, f₂, ... (with f₀ at the 0-th position) has
product a + b.
If f₀, f₁, f₂, ... and g₀, g₁, g₂, ... have sums a, b respectively, then
the ℤ-indexed sequence: ..., g₂, g₁, g₀, f₀, f₁, f₂, ... (with f₀ at the 0-th position) has
sum a + b.
If f₀, f₁, f₂, ... and g₀, g₁, g₂, ... are both multipliable then so is the
ℤ-indexed sequence: ..., g₂, g₁, g₀, f₀, f₁, f₂, ... (with f₀ at the 0-th position).
If f₀, f₁, f₂, ... and g₀, g₁, g₂, ... are both summable then so is the
ℤ-indexed sequence: ..., g₂, g₁, g₀, f₀, f₁, f₂, ... (with f₀ at the 0-th position).
If f₀, f₁, f₂, ... and g₀, g₁, g₂, ... are both multipliable, then the product of the
ℤ-indexed sequence: ..., g₂, g₁, g₀, f₀, f₁, f₂, ... (with f₀ at the 0-th position) is
(∏' n, f n) * ∏' n, g n.
If f₀, f₁, f₂, ... and g₀, g₁, g₂, ... are both summable, then the sum of the
ℤ-indexed sequence: ..., g₂, g₁, g₀, f₀, f₁, f₂, ... (with f₀ at the 0-th position) is
∑' n, f n + ∑' n, g n.
Alias of Summable.tsum_of_nat_of_neg.
Alias of Multipliable.tprod_of_nat_of_neg.
"iff" version of Multipliable.of_nat_of_neg_add_one.
"iff" version of Summable.of_nat_of_neg_add_one.
"iff" version of Multipliable.of_nat_of_neg.
"iff" version of Summable.of_nat_of_neg.
Alias of multipliable_pnat_iff_multipliable_succ.