To prove the statement, we will use mathematical induction.
1. Base Case:
For n=1, the only non-empty subset of {1} is {1} itself. Thus, the sum is:
∑i11=11=1
Therefore, the statement holds for n=1.
2. Inductive Step:
Assume the statement is true for n=k. That is, we assume:
{i1,i2,…,ij}⊆{1,2,…,k}{i1,i2,…,ij}=∅∑i1i2…ij1=k
We need to show that the statement holds for n=k+1. Consider the set {1,2,…,k+1}.
3. **Sum over subsets of {1,2,…,k+1}:**
The non-empty subsets of {1,2,…,k+1} can be divided into two categories:
- Subsets that do not contain k+1
- Subsets that contain k+1
4. **Subsets that do not contain k+1:**
These are exactly the non-empty subsets of {1,2,…,k}. By the induction hypothesis, the sum over these subsets is k.
5. **Subsets that contain k+1:**
For a subset S that contains k+1, we can write S=T∪{k+1}, where T is a subset of {1,2,…,k}. The sum over these subsets is:
T⊆{1,2,…,k}T=∅∑(i1i2…ij)(k+1)1=k+11T⊆{1,2,…,k}T=∅∑i1i2…ij1
By the induction hypothesis, the sum over all non-empty subsets T of {1,2,…,k} is k. Therefore, the sum over subsets containing k+1 is:
k+11⋅k=k+1k
6. Combining the sums:
The total sum over all non-empty subsets of {1,2,…,k+1} is the sum of the two parts:
k+k+1k
Simplifying this expression:
k+k+1k=k+1k(k+1)+k+1k=k+1k(k+1)+k=k+1k2+k+k=k+1k2+2k=k+1k(k+2)=k+1
Thus, the statement holds for n=k+1.
By the principle of mathematical induction, the statement is true for all n≥1.
■