is mentioned by
[sum_switch] | |
Thm* sum(f(x) | x < n) = sum(f(x) | x < m)+sum(f(x+m) | x < n-m) | [sum_split] |
Thm* m = k Thm* Thm* (x:n. x = m x = k f(x) = 0) sum(f(x) | x < n) = f(m)+f(k) | [pair_support] |
Thm* p:(k( List)). Thm* sum(||p(j)|| | j < k) = n Thm* & (j:k, x,y:||p(j)||. x<y (p(j))[x]>(p(j))[y]) Thm* & (j:k, x:||p(j)||. (p(j))[x]<n & c((p(j))[x]) = j) | [finite-partition] |
Thm* (x:n. x = m f(x) = 0) sum(f(x) | x < n) = f(m) | [singleton_support_sum] |
[empty_support] | |
Thm* sum(f(x) | x < n) = f(m)+sum(if x=m 0 else f(x) fi | x < n) | [isolate_summand] |
Thm* sum(if p(i) f(i)+g(i) else f(i) fi | i < k) Thm* = Thm* sum(f(i) | i < k)+sum(if p(i) g(i) else 0 fi | i < k) | [sum-ite] |
[sum_lower_bound] | |
[sum_bound] | |
Thm* (x:k. f(x)g(x)) sum(f(x) | x < k)sum(g(x) | x < k) | [sum_le] |
Thm* sum(f(x)-g(x) | x < n) = d sum(f(x) | x < n) = sum(g(x) | x < n)+d | [sum_difference] |
Thm* (i:n. f(i) = g(i)) sum(f(x) | x < n) = sum(g(x) | x < n) | [sum_functionality] |
[sum_constant] | |
Thm* sum(f(x) | x < n)+sum(g(x) | x < n) = sum(f(x)+g(x) | x < n) | [sum_linear] |
[non_neg_sum] | |
[double_sum] |
Try larger context:
MarkB generic
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html