Challenge in 4 Dimensions

Using Lagrange Four Square Theorem, classify the set of side lengths of a lattice hypercube in \( \mathbb{Z}^4 \).

Note by Calvin Lin
7 years, 6 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Alright. I'm going to take a crack at this. Thank you for your patience.

Theorem: The set of side lengths of hypercubes in R4\mathbb{R}^4 with vertices in Z4\mathbb{Z}^4 is precisely the image of the positive integers under the principal square root.

Proof: Let Z+\sqrt{\mathbb{Z}_+} denote the image of the positive integers under the principal square root. I wish to note that, if we wanted to consider the case of a degenerate hypercube as well, we would instead be considering the image of the nonnegative integers under the principal square root.

For the sake of comfort, I will provide an equivalent and facile definition of a hypercube. We define a hypercube as a square matrix composed of mutually orthogonal column vectors of the same magnitude. This is equivalent to defining, in our case, 4 vectors in R4\mathbb{R}^4 that are orthogonal and of the same magnitude, which then form the edges of the hypercube.

We wish to prove that a side length being an element of Z+\sqrt{\mathbb{Z}_+} is a necessary and sufficient condition for there to exist a hypercube of that side length with vertices in Z4\mathbb{Z}^4.

The necessity is satisfied because of the Lagrange Four Square Theorem. If we consider a vector xR4\vec{x}\in\mathbb{R}^4 with integer components, then its magnitude will be of the form x=m2+a2+t2+h2\|\vec{x}\|=\sqrt{m^2+a^2+t^2+h^2}, with m,a,t,hZm,a,t,h\in\mathbb{Z}. Every positive integer can be written in the form m2+a2+t2+h2m^2+a^2+t^2+h^2, and every m2+a2+t2+h2m^2+a^2+t^2+h^2 is a positive integer, so the side lengths we consider will necessarily be in Z+\sqrt{\mathbb{Z}_+}.

To show that the condition is sufficient, we construct a hypercube for a given side length. Suppose x2=m2+a2+t2+h2\|\vec{x}\|^2=m^2+a^2+t^2+h^2. Then, we consider the hypercube [mahtamththamhtma]\begin{bmatrix}m & -a & h & -t \\ a & m & t & h \\ t & -h & -a & m \\ h & t & -m & -a\end{bmatrix}. Clearly, every column x\vec{x} is orthogonal to the others and satisfies x2=m2+a2+t2+h2\|\vec{x}\|^2=m^2+a^2+t^2+h^2. Thus, there must exist a desired hypercube if the side length is in Z+\sqrt{\mathbb{Z}_+}. This completes the proof. \boxed{}

Jacob Erickson - 7 years, 5 months ago

Log in to reply

Thumbs up to the choice of variables.

Bob Krueger - 7 years, 5 months ago

I'm not exactly sure how this uses the Four Square Theorem, but here's my guess:

Since the side lengths are defined as the distance between two points, and all side lengths are the same, take any two points of the tesseract and calculate that distance by d=(a1a2)2+(b1b2)2+(c1c2)2+(d1d2)2d = \sqrt{(a_1-a_2)^2+(b_1-b_2)^2+(c_1-c_2)^2+(d_1-d_2)^2} where each point is defined by the ordered quadruple (ai,bi,ci,di)(a_i,b_i,c_i,d_i). Then, since every number can be expressed as the sum of at most four squares, the set of side lengths of a lattice hypercube is the set of all positive square roots of positive integers.

Bob Krueger - 7 years, 6 months ago

Log in to reply

In Z3 \mathbb{Z}^3 , is there a lattice cube of side length 1+1+1=3 \sqrt{1+1+1} = \sqrt{3} ?

Where does your above logic break down?

Calvin Lin Staff - 7 years, 6 months ago

Log in to reply

Clearly, there is no such lattice cube in Z3\mathbb{Z}^3, since we cannot have integers a,b,ca,b,c such that a+b+c=0a+b+c=0 and a2+b2+c2=3a^2+b^2+c^2=3.

I'm going to see if I can finish a solution. I think I have a partial answer and a large enough margin. However, I have a history project that I need to finish by tomorrow, so I'll have to get back to this on Friday.

Jacob Erickson - 7 years, 5 months ago

Log in to reply

@Jacob Erickson Can you explain your thinking step by step? Why do we need a+b+c=0 a + b + c = 0 ?

Calvin Lin Staff - 7 years, 5 months ago

Log in to reply

@Calvin Lin We have the vector [111]\begin{bmatrix}1 \\ 1 \\ 1\end{bmatrix} with magnitude 3\sqrt{3}. We wish to find a vector orthogonal to it under the given inner product. Thus, we want to find [abc]\begin{bmatrix}a \\ b \\ c\end{bmatrix} satisfying a+b+c=0a+b+c=0 from the "dot" product and a2+b2+c2=3a^2+b^2+c^2=3 for the magnitude.

Jacob Erickson - 7 years, 5 months ago

Log in to reply

@Jacob Erickson Thanks for the explanation. The important aspect here is that "There is no orthogonal vector", which is why no such 3-dimensional cube exists. Thus, going back to the 4-D case, we need to find 4 orthogonal vectors, or show that they do not exist.

For clarity, It seems like you made an assumption that one of the vectors must be (1,1,1,) (1,1,1,) . Of course, this need not be the case, as we start with vectors of the form (±1,±1,±1) (\pm 1, \pm 1, \pm1) , and it is best to add WLOG to the start.

Calvin Lin Staff - 7 years, 5 months ago

Log in to reply

@Calvin Lin My apologies. Indeed, I should note that I performed the above argument under the assumption that we all understood there was no loss of generality in assuming the starting vector was [111]T\begin{bmatrix}1 & 1 & 1\end{bmatrix}^T, since aa, bb, and cc can be positive or negative (or zero).

Jacob Erickson - 7 years, 5 months ago

How are you defining a hypercube in this case? Are we assuming that Z4\mathbb{Z}^4 inherits the standard Euclidean metric?

Jacob Erickson - 7 years, 5 months ago

Log in to reply

It would be the 4-D analogue of a cube. You would have to define 242^4 points. Alternatively, you could define 44 vectors which form the edges of the cube from 1 vertex, where the angles are all 9090^\circ.

Yes, standard Euclidean metric where distance between the points is (x1y1)2+(x2y2)2+(x3y3)2+(x4y4)2 \sqrt{ (x_1-y_1)^2 + (x_2-y_2)^2 + (x_3-y_3)^2 + (x_4-y_4)^2 } .

Calvin Lin Staff - 7 years, 5 months ago

m only read lagrange mean value theorem :(

Manoj Kumar - 7 years, 6 months ago
×

Problem Loading...

Note Loading...

Set Loading...