🧮 Brain Teaser

A Finite Set Closed Under Cross Product

Let ×\times denote the cross product in R3\mathbb{R}^3. For which positive integers nn does there exist a set S⊂R3S\subset\mathbb{R}^3 with exactly nn elements such that

S={ v×w  :  v,w∈S } ?S=\{\,v\times w \;:\; v,w\in S\,\}\ ?

Note that this is an equality of sets. Every cross product of two elements of SS must lie in SS, and every element of SS must arise as such a cross product.

Hint: the answer is not "only n=1n=1."

cross productlinear algebrafiniteness argumentorthonormal framePutnam 2022

Answer: A Finite Set Closed Under Cross Product

Key Idea / Intuition

The cross product can stretch and shrink lengths. If some nonzero vector had length ≠1\neq 1, you could cross with it repeatedly and produce infinitely many distinct vectors. So finiteness forces every nonzero element to be a unit vector.

Once all nonzero lengths are 11, the identity ∣s×t∣=sin⁡θ|s\times t|=\sin\theta forces every pair of vectors to be either parallel or orthogonal. What survives is an orthonormal frame together with its negatives and 00. This is exactly {0,±i,±j,±k}\{0,\pm i,\pm j,\pm k\}, the "quaternion units," and it has 77 elements.

Answer: n=1n=1 and n=7n=7.


Formal Proof / Solution

Step 0: 0∈S0\in S. The set SS is nonempty, so pick v∈Sv\in S. Then 0=v×v∈S0=v\times v\in S.

So S={0}S=\{0\} works, and n=1n=1 is possible. From now on, assume SS contains a nonzero vector.

Step 1: every nonzero element of SS has a nonzero perpendicular partner in SS. Let s∈Ss\in S with s≠0s\neq 0. Then s=a×bs=a\times b for some a,b∈Sa,b\in S. Since s≠0s\ne 0, we have a≠0a\neq 0, and s⊥as\perp a.

Step 2: every nonzero element of SS is a unit vector. Take ss and aa as in Step 1, so s⊥as\perp a and both are nonzero elements of SS. For any vector x⊥sx\perp s, the BAC–CAB rule gives

(s×x)×s  =  − s×(s×x)  =  −(s (s⋅x)−x ∣s∣2)  =  ∣s∣2 x.(s\times x)\times s \;=\; -\,s\times(s\times x)\;=\; -\big(s\,(s\cdot x)-x\,|s|^2\big)\;=\;|s|^2\,x .

Set a0=aa_0=a and ak+1=(s×ak)×sa_{k+1}=(s\times a_k)\times s. Each aka_k is a multiple of aa, so it stays perpendicular to ss. Since SS is closed under ×\times, each aka_k lies in SS. The formula above gives

ak=∣s∣2k a.a_k=|s|^{2k}\,a .

If ∣s∣≠1|s|\neq 1, these vectors have distinct lengths, so SS would be infinite. Hence ∣s∣=1|s|=1.

Step 3: nonzero elements are pairwise parallel or orthogonal. For nonzero s,t∈Ss,t\in S at angle θ\theta, the vector s×ts\times t lies in SS and has length sin⁡θ\sin\theta. By Step 2, this length must be 00 or 11. Therefore θ∈{0,π/2,π}\theta\in\{0,\pi/2,\pi\}.

Step 4: identifying SS. Pick a nonzero s∈Ss\in S and write s=a×bs=a\times b with a,b∈Sa,b\in S. Then aa and bb are nonzero unit vectors, and sin⁡∠(a,b)=∣s∣=1\sin\angle(a,b)=|s|=1, so a⊥ba\perp b. Thus (a,b,s)(a,b,s) is a right-handed orthonormal frame, and

b×a=−s,s×a=b,a×s=−b,b×s=a,s×b=−a.b\times a=-s,\quad s\times a=b,\quad a\times s=-b,\quad b\times s=a,\quad s\times b=-a .

So S⊇{0,±a,±b,±s}S\supseteq\{0,\pm a,\pm b,\pm s\}.

Now take any nonzero t∈St\in S. It is a unit vector, and by Step 3 it is parallel or orthogonal to each of aa, bb, ss. It cannot be orthogonal to all three, since they span R3\mathbb{R}^3. So tt is parallel to one of them, which means t∈{±a,±b,±s}t\in\{\pm a,\pm b,\pm s\}.

Hence S={0,±a,±b,±s},∣S∣=7.S=\{0,\pm a,\pm b,\pm s\},\qquad |S|=7 .

Step 5: n=7n=7 really works. Take S={0,±e1,±e2,±e3}S=\{0,\pm e_1,\pm e_2,\pm e_3\}.

  • Closure: each product ei×eje_i\times e_j lies in {0,±ek}\{0,\pm e_k\}, so all cross products stay in SS.
  • Every element is attained: 0=e1×e10=e_1\times e_1, and ±e3=±e1×e2\pm e_3=\pm e_1\times e_2. The other basis vectors are handled the same way by cyclic symmetry.

So S={v×w:v,w∈S}S=\{v\times w : v,w\in S\}.

n∈{1,7}\boxed{n\in\{1,7\}}

Remark. For pure quaternions, v×wv\times w is the imaginary part of the product vwvw. The 7-element set is the quaternion group {±1,±i,±j,±k}\{\pm1,\pm i,\pm j,\pm k\} with ±1\pm1 replaced by 00, because the real part has been discarded.

Source: Putnam 2022, Problem B2 (materials/putnam/2022.pdf; solutions in materials/putnam/2022s.pdf)

Type: PutnamSource: Putnam 2022, Problem B2 (materials/putnam/2022.pdf; solutions in materials/putnam/2022s.pdf)Edit on GitHub ↗