Infinite sum or product in an order #
This file provides lemmas about the interaction of infinite sums and products and order operations.
See also Summable.tsum_add for more general result without CompleteLattice assumption.
See also Summable.tsum_union_of_disjoint for more general result without CompleteLattice
assumption.
See also Summable.tsum_comm' for more general result without CompleteLattice assumption.
See also Summable.tsum_prod' for more general result without CompleteLattice assumption.
See also Summable.tsum_prod' for more general result without CompleteLattice assumption.
See also Summable.tsum_sigma' for more general result without CompleteLattice assumption.
See also Summable.tsum_sigma' for more general result without CompleteLattice assumption.
See also Summable.tsum_le_tsum for more general result without CompleteLattice
assumption.
See also Summable.sum_le_tsum for more general result without CompleteLattice assumption.
See also Summable.le_tsum' for more general result without CompleteLattice assumption.
See also Summable.tsum_eq_zero_iff for more general result without CompleteLattice
assumption.
See also Summable.tsum_le_tsum_of_inj for more general result without CompleteLattice
assumption.
For infinite sums taking values in a linearly ordered monoid, the existence of a least upper bound for the finite sums is a criterion for summability.
This criterion is useful when applied in a linearly ordered monoid which is also a complete or
conditionally complete linear order, such as ℝ, ℝ≥0, ℝ≥0∞, because it is then easy to check
the existence of a least upper bound.
Alias of the reverse direction of summable_abs_iff.
Alias of the forward direction of summable_abs_iff.
Positivity extension for infinite sums.
This extension only proves non-negativity, strict positivity is more delicate for infinite sums and requires more assumptions.