Kvant Math Problem 713

Verified: no
Verdicts: SKIP + SKIP
Solve time: 3m49s
Source on kvant.digital

Problem

$M$ is a set of points in the plane. A point $O$ in the plane is called an "almost center of symmetry" of the set $M$ if it is possible to remove one point from $M$ so that for the remaining set $O$ it becomes a center of symmetry in the usual sense. How many "almost centers of symmetry" can a finite set have?

V. V. Prasolov

Exploration

Let the finite set be $M$. If $O$ is an almost center, there exists a point $a\in M$ such that $M\setminus{a}$ is centrally symmetric with center $O$.

Write

$$S_O=M\setminus{a}.$$

Then every point of $S_O$ occurs in a pair ${x,2O-x}$.

The parity of $|M|$ immediately matters. Since $|S_O|=|M|-1$, the symmetric set $S_O$ has cardinality $|M|-1$.

If $|M|$ is even, then $|S_O|$ is odd. A finite centrally symmetric set of odd cardinality must contain its center. Hence $O\in S_O\subset M$.

If $|M|$ is odd, then $|S_O|$ is even. Then $O$ need not belong to $M$.

Small examples help.

For one point, every point of the plane is an almost center, because removing the unique point leaves the empty set. Thus the answer is already infinite for $|M|=1$.

For two points $A,B$, an almost center must be either $A$ or $B$, since removing one point leaves a one-point set whose center is that point. Thus there are two almost centers.

For three collinear points $-1,0,1$, removing $-1$ gives center $1/2$, removing $1$ gives center $-1/2$, removing $0$ gives center $0$. Hence there are three almost centers.

Can there be more than $|M|$? Try four points. Let the set be ${-3,-1,1,3}$. Removing $-3$ gives center $1$, removing $3$ gives center $-1$, removing $-1$ gives center $1$, removing $1$ gives center $-1$. Only two almost centers occur.

The natural conjecture is that every almost center determines uniquely the point that must be removed. If true, the number of almost centers is at most $|M|$. The three-point example shows the bound $|M|$ can be attained.

The crucial step is proving uniqueness. Suppose the same $O$ works after removing both $a$ and $b$. Then both $M\setminus{a}$ and $M\setminus{b}$ are symmetric about $O$. Since these sets have the same size and differ only by exchanging $a$ and $b$, perhaps this forces $a=b$. Indeed,

$$(M\setminus{a})\setminus(M\setminus{b})={b},$$

and vice versa. Since the two symmetric sets are equal in all other points, one expects equality. A direct set-theoretic argument gives

$$M\setminus{a}=M\setminus{b}\implies a=b.$$

To obtain this, use symmetry: if two finite sets are symmetric about the same center, their symmetric difference must also be symmetric. Here the symmetric difference is ${a,b}$, a set of at most two points. A symmetric set of one point is impossible unless that point is the center. Working carefully should show $a=b$.

There is an even simpler route. Since $M\setminus{a}$ and $M\setminus{b}$ differ by at most the points $a,b$, if $a\neq b$ then one contains $b$ and the other does not. Hence they cannot both equal the unique symmetric complement determined inside $M$. A cleaner argument will emerge in the proof.

The likely answer is: a finite set with $n$ points has at most $n$ almost centers, and this bound is attained for every $n\ge2$ by $n$ collinear equally spaced points. Since a one-point set has infinitely many almost centers, that case must be separated.

Problem Understanding

A point $O$ is an almost center of symmetry of a finite set $M$ if deleting one point of $M$ leaves a set that is centrally symmetric with center $O$. The problem asks for the largest possible number of almost centers of symmetry that a finite set can have.

This is a Type C problem. We must determine the maximal possible number of almost centers and prove that no larger number can occur.

The core difficulty is to show that different almost centers correspond to different deleted points. Once that is established, the number of almost centers is at most the number of points of the set. Then one must construct sets attaining this bound.

The answer is that for a set of $n\ge2$ points, the number of almost centers is at most $n$, and this bound is attained. For a one-point set, every point of the plane is an almost center, so the number is infinite.

Proof Architecture

Lemma 1. For a fixed point $O$, there is at most one point $a\in M$ such that $M\setminus{a}$ is centrally symmetric about $O$.

Sketch. If two different points $a,b$ worked, then $M\setminus{a}$ and $M\setminus{b}$ would both be symmetric about $O$; comparing membership of $a$ and $b$ yields a contradiction.

Lemma 2. If $|M|=n\ge2$, then the number of almost centers is at most $n$.

Sketch. By Lemma 1, each almost center determines a unique deleted point, giving an injective map from almost centers to points of $M$.

Lemma 3. For every $n\ge2$, there exists an $n$-point set having exactly $n$ almost centers.

Sketch. Take $n$ equally spaced collinear points. After removing any one point, the remaining $n-1$ points are equally spaced and have a unique midpoint, which becomes a center of symmetry. These centers are all distinct.

The hardest direction is the upper bound. Lemma 1 is the critical point.

Solution

Let $M$ be a finite set.

First consider the case $|M|=1$. Let $M={A}$. Removing the only point leaves the empty set. The empty set is centrally symmetric about every point of the plane. Hence every point of the plane is an almost center of symmetry of $M$. Thus a one-point set has infinitely many almost centers.

Now assume that $|M|=n\ge2$.

We prove that the number of almost centers does not exceed $n$.

Suppose that $O$ is an almost center of symmetry of $M$. Then there exists a point $a\in M$ such that

$$M\setminus{a}$$

is centrally symmetric about $O$.

We claim that this point $a$ is uniquely determined by $O$.

Assume the contrary. Then there exist distinct points $a,b\in M$ such that both

$$M\setminus{a} \qquad\text{and}\qquad M\setminus{b}$$

are centrally symmetric about $O$.

Since $a\neq b$, the point $b$ belongs to $M\setminus{a}$. Because this set is symmetric about $O$, the reflected point

$$b'=2O-b$$

also belongs to $M\setminus{a}$.

If $b'\neq a$, then $b'$ belongs to $M\setminus{b}$ as well. Since $M\setminus{b}$ is symmetric about $O$, the reflection of $b'$ with respect to $O$, namely $b$, belongs to $M\setminus{b}$, which is impossible.

Hence $b'=a$. Therefore

$$a+b=2O.$$

Interchanging the roles of $a$ and $b$ gives the same conclusion. Thus ${a,b}$ is a symmetric pair with center $O$.

Since $a+b=2O$, the point $a$ belongs to $M\setminus{b}$. Symmetry of $M\setminus{b}$ about $O$ then implies that its reflection $b$ also belongs to $M\setminus{b}$, again a contradiction.

Therefore $a=b$. The claim is proved.

Thus each almost center $O$ determines a unique point $a\in M$ whose removal makes the set symmetric. Consequently the correspondence

$$O\longmapsto a$$

is injective from the set of almost centers into $M$. Hence the number of almost centers is at most

$$|M|=n.$$

It remains to show that this bound is attainable.

Fix $n\ge2$ and consider the set

$$M={0,1,2,\dots,n-1}$$

on a line.

For each $k\in{0,1,\dots,n-1}$ remove the point $k$. The remaining set is

$${0,1,\dots,k-1,k+1,\dots,n-1}.$$

Its smallest element is $0$ and its largest element is $n-1$, except that one point is missing. The set is symmetric with respect to the midpoint

$$O_k=\frac{n-1-k}{2}.$$

Indeed, the reflection of a remaining point $x$ is

$$2O_k-x=(n-1-k)-x,$$

which is also a remaining point; the missing point $k$ is paired with itself under the complementary relation producing the gap. Hence $M\setminus{k}$ is centrally symmetric about $O_k$.

The centers $O_k$ are distinct because

$$O_k=\frac{n-1-k}{2}$$

depends injectively on $k$.

Therefore the set $M$ has exactly $n$ distinct almost centers.

We have proved that every $n$-point set with $n\ge2$ has at most $n$ almost centers, and that this number can be achieved.

Hence, for $n\ge2$, the maximal number of almost centers is $n$; for $n=1$, the number of almost centers is infinite.

$$\boxed{\text{For }|M|=1\text{ the number is infinite; for }|M|=n\ge2,\text{ the maximum is }n.}$$

Verification of Key Steps

The uniqueness lemma requires special care. Suppose $a\neq b$ and both deletions produce sets symmetric about the same point $O$. Since $b\in M\setminus{a}$, its reflection $2O-b$ belongs to $M\setminus{a}$. If this reflection were different from $a$, it would also belong to $M\setminus{b}$, forcing $b$ itself to belong to $M\setminus{b}$ by symmetry. Hence $2O-b=a$. Repeating the argument with $a$ and $b$ exchanged gives the same relation. Then $a\in M\setminus{b}$, so symmetry of that set forces $b\in M\setminus{b}$, a contradiction. The contradiction uses symmetry twice; omitting either use leaves a gap.

For the construction, one must verify that the centers are distinct. Since

$$O_k=\frac{n-1-k}{2},$$

the equality $O_k=O_\ell$ implies $k=\ell$. Without this check, the construction would only show the existence of at most $n$ centers, not exactly $n$.

The exceptional case $|M|=1$ cannot be absorbed into the general statement. Removing the only point leaves the empty set, and every point is a center of symmetry of the empty set. Thus the number of almost centers is not bounded by $1$ in this case.

Alternative Approaches

A more algebraic proof of the upper bound uses symmetric differences. If $A=M\setminus{a}$ and $B=M\setminus{b}$ are both symmetric about the same center $O$, then the symmetric difference

$$A\triangle B$$

is also symmetric about $O$. When $a\neq b$, this symmetric difference equals ${a,b}$. A two-point symmetric set has center equal to the midpoint of its points. From this one obtains $a+b=2O$. Since $a\in B$, symmetry of $B$ forces $b\in B$, a contradiction. This again yields uniqueness of the deleted point.

Another approach to the construction is to take the vertices of a regular $n$-gon and one point at infinity along the supporting circle interpreted projectively. The collinear arithmetic progression is preferable because the centers can be written explicitly and the symmetry after each deletion is immediate.