The set $ S$ consists of $ n > 2$ points in the plane. The set $ P$ consists of $ m$ lines in the plane such that every line in $ P$ is an axis of symmetry for $ S$. Prove that $ m\leq n$, and determine when equality holds.
Let \( S \) be a set of \( n \) points in the plane, and let \( P \) be a set of \( m \) lines in the plane such that every line in \( P \) is an axis of symmetry for \( S \). We need to prove that \( m \leq n \) and determine when equality holds.

1. **Convex Hull and Symmetry Lines:**
   Let \( C \) be the convex hull of the \( n \) points. Assume that \( C \) is a \( c \)-gon (a polygon with \( c \) vertices).

2. **Case 1: Lines Not Containing Vertices of \( C \):**
   - If one of the lines in \( P \) contains none of the vertices of \( C \), then \( c = 2x \) is even (since the line must divide the vertices of \( C \) into two equal sets).
   - Each line that goes through a vertex \( A \) must also go through another vertex \( B \), with exactly \( x-1 \) vertices of \( C \) between \( A \) and \( B \) along the boundary of \( C \). Thus, there is at most one line through \( A \) and this line is the same as the one through \( B \). Therefore, there are at most \( x \) lines through the vertices of \( C \).
   - Each line \( \Delta \) that does not contain a vertex of \( C \) must go through the interior of two opposite sides of \( C \), say \([AB]\) and \([MP]\), and \( \Delta \) is their common perpendicular bisector. Thus, there are at most \( x \) such lines. Additionally, the other vertices of \( C \) can be paired such that \( \Delta \) is the perpendicular bisector of each pair.

   Therefore, there are at most \( 2x \leq n \) lines in \( P \).

   If equality occurs, then \( S = C \) (since \( 2x = n \)), and the \( n \) points must be the vertices of a regular \( n \)-gon. In this case, \( P \) is the set of all axes of symmetry of \( S \).

3. **Case 2: Lines Containing Vertices of \( C \):**
   - If each of the \( m \) lines contains at least one vertex of \( C \), then each line divides the \( n \) points into two sets with the same number of points. Thus, each vertex of \( C \) belongs to at most one of the lines. Therefore, there are at most \( c \leq n \) lines in \( P \).

   If equality occurs, then \( S = C \) and each line contains exactly one of the points (otherwise, two points would define the same axis, and there would be fewer than \( n \) lines). Thus, \( n \) is odd. For each pair of vertices \( A \) and \( B \), there is exactly one vertex \( M \) such that the arcs \( AM \) and \( BM \) along the boundary of \( C \) contain the same number of vertices. Using the axis of symmetry through \( M \), this line is the perpendicular bisector of \([AB]\), implying that the \( n \) points are the vertices of a regular \( n \)-gon.

Thus, in each case, we have \( m \leq n \) and equality occurs if and only if the \( n \) points are the vertices of a regular \( n \)-gon, and \( P \) is the set of all axes of symmetry of \( S \).

\(\blacksquare\)

The final answer is \( \boxed{ m \leq n } \) and equality holds if and only if the \( n \) points are the vertices of a regular \( n \)-gon, and \( P \) is the set of all axes of symmetry of \( S \).