For each positive integer k, we prove that the minimum value of S2k is k2+2; the minimum value of S2k+1 is k(k+1)+2.
Firstly, define the sets A1,A2,…,A2k,A2k+1 as follows:
Ai={i,i+1,…,k},i=1,2,…,k;Ak+1={k,k+1};
Ak+j={k+1,k+2,…,k+j−1},j=2,3,…,k+1.
For this family of sets, it is easy to verify that
∣AiΔAj∣=j−i=∣i−j∣ holds in the following cases:
(1) 1≤i<j≤k;
(2) 1≤i<j=k+1;
(3) 1≤i<k+1<j≤2k+1;
(4) k+1=i<j≤2k+1;
(5) k+2≤i<j≤2k+1.
Moreover, the case of i=j is trivial, and the case of i>j can be reduced to the case of i<j. Thus for all i,j∈{1,2,…,2k+1}, we have verified that
∣AiΔAj∣=j−i=∣i−j∣.
For the above (2k+1) sets, we can easily calculate that
S2k+1=2k(k+1)+2+2k(k+1)=k(k+1)+2;
if we choose the first 2k sets, we get that
S2k=S2k+1−k=k2+2.
Secondly, we show that S2k≥k2+2 and S2k+1≥k(k+1)+2. Note the following facts:
Fact 1: for any two finite sets X,Y, we have
∣X∣+∣Y∣≥∣XΔY∣.
Fact 2: for any two nonempty finite sets X,Y, if ∣XΔY∣=1, then ∣X∣+∣Y∣≥3.
When n=2k, it follows from Fact 1 that
∣Ai∣+∣A2k+1−i∣≥∣AiΔA2k+1−i∣=2k+1−2i,i=1,2,…,k−1.
By ∣AkΔAk+1∣=1 and Fact 2, we have ∣Ak∣+∣Ak+1∣≥3. So
S2k=∣Ak∣+∣Ak+1∣+i=1∑k−1(∣Ai∣+∣A2k+1−i∣)≥3+i=1∑k−1(2k+1−2i)=k2+2.
Similarly, when n=2k+1, we get that
∣Ai∣+∣A2k+2−i∣≥∣AiΔA2k+2−i∣=2k+2−2i,i=1,2,…,k−1.
Since ∣AkΔAk+1∣=1, we have
(∣Ak∣+∣Ak+1∣)+∣Ak+2∣≥3+1=4,
SO
S2k+1=∣Ak∣+∣Ak+1∣+∣Ak+2∣+i=1∑k−1(∣Ai∣+∣A2k+2−i∣)
≥4+i=1∑k−1(2k+2−2i)=k(k+1)+2.
In conclusion, the minimum value of S2k is k2+2, the minimum value of S2k+1 is k(k+1)+2. Equivalently, for any n≥2, the minimum value of Sn is ⌊4n2⌋+2.