Solution. The unit sphere in R n \mathbb{R}^n R n is defined by
S n − 1 = { ( x 1 , … , x n ) ∈ R n ∣ ∑ k = 1 n x k 2 = 1 } . S_{n-1}=\left\{(x_1,\dots,x_n)\in\mathbb{R}^n|\sum_{k=1}^nx_k^2=1\right\}. S n − 1 = { ( x 1 , … , x n ) ∈ R n ∣ k = 1 ∑ n x k 2 = 1 } .
The distance between the points
X = ( x 1 , … , x n ) X=(x_1,\dots,x_n) X = ( x 1 , … , x n ) and
Y = ( y 1 , … , y n ) Y=(y_1,\dots,y_n) Y = ( y 1 , … , y n ) is:
d 2 ( X , Y ) = ∑ k = 1 n ( x k − y k ) 2 . d^2(X,Y)=\sum_{k=1}^n(x_k-y_k)^2. d 2 ( X , Y ) = k = 1 ∑ n ( x k − y k ) 2 .
We have
d ( X , Y ) > 2 ⇔ d 2 ( X , Y ) > 2 ⇔ ∑ k = 1 n x k 2 + ∑ k = 1 n y k 2 + 2 ∑ k = 1 n x k y k > 2 ⇔ ∑ k = 1 n x k y k < 0 \begin{aligned}d(X,Y)>\sqrt2\quad&\Leftrightarrow\quad d^2(X,Y)>2\\&\Leftrightarrow\quad\sum_{k=1}^nx_k^2+\sum_{k=1}^ny_k^2+2\sum_{k=1}^nx_ky_k>2\\&\Leftrightarrow\quad\sum_{k=1}^nx_ky_k<0\end{aligned} d ( X , Y ) > 2 ⇔ d 2 ( X , Y ) > 2 ⇔ k = 1 ∑ n x k 2 + k = 1 ∑ n y k 2 + 2 k = 1 ∑ n x k y k > 2 ⇔ k = 1 ∑ n x k y k < 0
Taking account of the symmetry of the sphere, we can suppose that
A 1 = ( − 1 , 0 , … , 0 ) . A_1=(-1,0,\dots,0). A 1 = ( − 1 , 0 , … , 0 ) .
For
X = A 1 X=A_1 X = A 1 ,
∑ k = 1 n x k y k < 0 \sum\limits_{k=1}^nx_ky_k<0 k = 1 ∑ n x k y k < 0 implies
y 1 > 0 y_1>0 y 1 > 0 ,
∀ Y ∈ M n \forall\,Y\in M_n ∀ Y ∈ M n .
Let X = ( x 1 , X ‾ ) X=(x_1,\overline{X}) X = ( x 1 , X ) , Y = ( y 1 , Y ‾ ) ∈ M n \ { A 1 } Y=(y_1,\overline{Y})\in M_n\backslash\{A_1\} Y = ( y 1 , Y ) ∈ M n \ { A 1 } , X ‾ , Y ‾ ∈ R n − 1 \overline{X},\overline{Y}\in\mathbb{R}^{n-1} X , Y ∈ R n − 1 .
We have
∑ k = 1 n x k y k < 0 ⇒ x 1 y 1 + ∑ k = 1 n − 1 x ‾ k y ‾ k < 0 ⇔ ∑ k = 1 n − 1 x k ′ y k ′ < 0 , \sum_{k=1}^nx_ky_k<0\Rightarrow x_1y_1+\sum_{k=1}^{n-1}\overline{x}_k\overline{y}_k<0\Leftrightarrow\sum_{k=1}^{n-1}x_k'y_k'<0, k = 1 ∑ n x k y k < 0 ⇒ x 1 y 1 + k = 1 ∑ n − 1 x k y k < 0 ⇔ k = 1 ∑ n − 1 x k ′ y k ′ < 0 ,
where
x k ′ = x ‾ k ∑ x ‾ k 2 , y k ′ = y ‾ k ∑ y ‾ k 2 . x_k'=\frac{\overline{x}_k}{\sqrt{\sum\overline{x}_k^2}},\quad y_k'=\frac{\overline{y}_k}{\sqrt{\sum\overline{y}_k^2}}. x k ′ = ∑ x k 2 x k , y k ′ = ∑ y k 2 y k .
therefore
( x 1 ′ , … , x n − 1 ′ ) , ( y 1 ′ , … , y n − 1 ′ ) ∈ S n − 2 (x_1',\dots,x_{n-1}'),(y_1',\dots,y_{n-1}')\in S_{n-2} ( x 1 ′ , … , x n − 1 ′ ) , ( y 1 ′ , … , y n − 1 ′ ) ∈ S n − 2
and verifies
∑ k = 1 n x k y k < 0 \sum\limits_{k=1}^nx_ky_k<0 k = 1 ∑ n x k y k < 0 .
If a n a_n a n is the search number of points in R n \mathbb{R}^n R n we obtain a n ≤ 1 + a n − 1 a_n\le1+a_{n-1} a n ≤ 1 + a n − 1 and a 1 = 2 a_1=2 a 1 = 2 implies that a n ≤ n + 1 a_n\le n+1 a n ≤ n + 1 .
We show that a n = n + 1 a_n=n+1 a n = n + 1 , giving an example of a set M n M_n M n with ( n + 1 ) (n+1) ( n + 1 ) elements satisfying the conditions of the problem.
A 1 = ( − 1 , 0 , 0 , 0 , … , 0 , 0 ) A 2 = ( 1 n , − c 1 , 0 , 0 , … , 0 , 0 ) A 3 = ( 1 n , 1 n − 1 ⋅ c 1 , − c 2 , 0 , … , 0 , 0 ) A 4 = ( 1 n , 1 n − 1 ⋅ c 1 , 1 n − 1 ⋅ c 2 , − c 3 , … , 0 , 0 ) \begin{aligned}A_1&=(-1,0,0,0,\dots,0,0)\\A_2&=\bigl(\tfrac1n,-c_1,0,0,\dots,0,0\bigr)\\A_3&=\Bigl(\tfrac1n,\tfrac{1}{n-1}\cdot c_1,-c_2,0,\dots,0,0\Bigr)\\A_4&=\Bigl(\tfrac1n,\tfrac{1}{n-1}\cdot c_1,\tfrac{1}{n-1}\cdot c_2,-c_3,\dots,0,0\Bigr)\end{aligned} A 1 A 2 A 3 A 4 = ( − 1 , 0 , 0 , 0 , … , 0 , 0 ) = ( n 1 , − c 1 , 0 , 0 , … , 0 , 0 ) = ( n 1 , n − 1 1 ⋅ c 1 , − c 2 , 0 , … , 0 , 0 ) = ( n 1 , n − 1 1 ⋅ c 1 , n − 1 1 ⋅ c 2 , − c 3 , … , 0 , 0 )
A n − 1 = ( 1 n , 1 n − 1 ⋅ c 1 , 1 n − 2 ⋅ c 2 , 1 n − 3 ⋅ c 3 , … , − c n − 2 , 0 ) A n = ( 1 n , 1 n − 1 ⋅ c 1 , 1 n − 2 ⋅ c 1 , 1 n − 3 ⋅ c 3 , … , 1 2 ⋅ c n − 2 , − c n − 1 ) A n + 1 = ( 1 n , 1 n − 1 ⋅ c 1 , 1 n − 2 ⋅ c 2 , 1 n − 3 ⋅ c 3 , … , 1 2 ⋅ c n − 2 , c n − 1 ) \begin{aligned}A_{n-1}&=\Bigl(\tfrac1n,\tfrac{1}{n-1}\cdot c_1,\tfrac{1}{n-2}\cdot c_2,\tfrac{1}{n-3}\cdot c_3,\dots,-c_{n-2},0\Bigr)\\A_n&=\Bigl(\tfrac1n,\tfrac{1}{n-1}\cdot c_1,\tfrac{1}{n-2}\cdot c_1,\tfrac{1}{n-3}\cdot c_3,\dots,\tfrac12\cdot c_{n-2},-c_{n-1}\Bigr)\\A_{n+1}&=\Bigl(\tfrac1n,\tfrac{1}{n-1}\cdot c_1,\tfrac{1}{n-2}\cdot c_2,\tfrac{1}{n-3}\cdot c_3,\dots,\tfrac12\cdot c_{n-2},c_{n-1}\Bigr)\end{aligned} A n − 1 A n A n + 1 = ( n 1 , n − 1 1 ⋅ c 1 , n − 2 1 ⋅ c 2 , n − 3 1 ⋅ c 3 , … , − c n − 2 , 0 ) = ( n 1 , n − 1 1 ⋅ c 1 , n − 2 1 ⋅ c 1 , n − 3 1 ⋅ c 3 , … , 2 1 ⋅ c n − 2 , − c n − 1 ) = ( n 1 , n − 1 1 ⋅ c 1 , n − 2 1 ⋅ c 2 , n − 3 1 ⋅ c 3 , … , 2 1 ⋅ c n − 2 , c n − 1 )
where
c k = ( 1 + 1 n ) ( 1 − 1 n − k + 1 ) , k = 1 , n − 1 ‾ . c_k=\sqrt{\left(1+\frac1n\right)\left(1-\frac{1}{n-k+1}\right)},\quad k=\overline{1,n-1}. c k = ( 1 + n 1 ) ( 1 − n − k + 1 1 ) , k = 1 , n − 1 .
We have
∑ k = 1 n x k y k = − 1 n < 0 \sum\limits_{k=1}^nx_ky_k=-\frac1n<0 k = 1 ∑ n x k y k = − n 1 < 0 and
∑ k − = 1 n x k 2 = 1 \sum\limits_{k-=1}^nx_k^2=1 k − = 1 ∑ n x k 2 = 1 ,
∀ X , Y ∈ { A 1 , … , A n + 1 } \quad\forall X,Y\in\{A_1,\dots,A_{n+1}\} ∀ X , Y ∈ { A 1 , … , A n + 1 } .
These points are on the unit sphere in R n \mathbb{R}^n R n and the distance between any two points is equal to
d = 2 1 + 1 n > 2 . d=\sqrt2\sqrt{1+\frac1n}>\sqrt2. d = 2 1 + n 1 > 2 .
Remark. For n = 2 n=2 n = 2 the points form an equilateral triangle in the unit circle; for n = 3 n=3 n = 3 the four points from a regular tetrahedron and in R n \mathbb{R}^n R n the points from an n n n dimensional regular simplex.
Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδες 2–3. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.