Countable subadditivity of a set function 
is the property that, for any countable disjoint collection of sets 
on which 
is defined,
 |
A function possessing countable subadditivity is said to be countably subadditive.
Any countably subadditive function 
is also finitely subadditive
presuming that 
where 
is the empty set.
