Shapes with Progressive Dimensionality

Geometry Level 3

Consider a 1-D line segment of length 1. How far apart can two points be on the line segment?
Consider a 2-D square with side length 1. How far apart can two points be on the square? Consider a 3-D cube with side length 1. How far apart can two points be on the cube?

Notice how each ( n + 1 ) (n+1)- dimensional object is an extrapolation of an n n- dimensional object. The square is essentially a line segment moved at a right angle to itself through an equal distance. And the cube is essentially a square moved at a right angle to itself through an equal distance.

Suppose we extrapolated once more in this fashion to create a 4-D object from the cube. Based on the pattern we've seen so far, what should be the maximum possible "distance" between two points on the 4-D object (enter this number as your answer)?


The answer is 2.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Jason Dyer Staff
Dec 15, 2016

The four-dimensional version of the distance formula for coordinates ( x , y , z , q ) (x,y,z,q) is

( x 2 x 1 ) 2 + ( y 2 y 1 ) 2 + ( z 2 z 1 ) 2 + ( q 2 q 1 ) 2 . \sqrt{(x_2-x_1)^2 + (y_2-y_1)^2 + (z_2-z_1)^2 + (q_2-q_1)^2} .

When restricting values in the interval [0,1], the maximum possible difference for each term in the formula above is 1. This can be achieved (for example) using the coordinate values (0, 0, 0, 0) and (1, 1, 1, 1).

( 1 0 ) 2 + ( 1 0 ) 2 + ( 1 0 ) 2 + ( 1 0 ) 2 = 1 + 1 + 1 + 1 = 4 = 2. \sqrt{(1-0)^2 + (1-0)^2 + (1-0)^2 + (1-0)^2} = \sqrt{1 + 1 + 1 +1} = \sqrt{4} = 2 .


(The image below is of a hypercube, although the four-dimensional sides are omitted for clarity.)

Also, if we consider (0, 0, 0, 0) our start point, note the vector < 1 , 1 , 1 , 0 > \left<1,1,1,0\right> represents the diagonal of the cube (already given as a distance of 3 ) , \sqrt{3}), and < 0 , 0 , 0 , 1 > \left<0,0,0,1\right> represents the vector connecting the far corner of the cube to the corresponding corner of the hypercube (a distance of 1, since it's simply one side of the hypercube). By the dot product ( 1 ) ( 0 ) + ( 1 ) ( 0 ) + ( 1 ) ( 0 ) + ( 0 ) ( 1 ) = 0 (1)(0) + (1)(0) + (1)(0) + (0)(1) = 0 they are perpendicular, so we can apply the Pythagorean Theorem to find the distance between the points (0, 0, 0, 0) and (1, 1, 1, 1):

3 2 + 1 2 = 3 + 1 = 4 = 2 \sqrt{\sqrt{3}^2 + 1^2} = \sqrt{3+1} = \sqrt{4} = 2

Sabhrant Sachan
Dec 12, 2016

d max , n , l = l n \large d_{\text{max},n,l} = l\sqrt{n}

d max , 4 , 1 = 4 = 2 \boxed {\large d_{\text{max},4,1} = \sqrt{4} = 2}

Where d max d_{\text{max}} is the Maximum distance between any two points in a n t h n^{th} dimensional space and l l is the side length of the n t h n^{th} dimensional space

This is all based on the pattern observed for 1 , 2 1,2 and 3 3 dimensions.

How do you know that the pattern continues?

A Former Brilliant Member - 4 years, 6 months ago

If you want to work it out as a full pattern, you can extract from my solution; other than the obvious "use the n-dimensional version of distance formula" which will get you sqrt(1+1+1+...+1) with 1 occurring n times, you could note each dimension uses the vector <1,1,1,1,1,...,1,0> and <0,0,0,0,0,...,0,1> which must be perpendicular, so you use Pythagorean theorem on the previous answer. You'll get a Spiral of Theodorus scenario: https://en.wikipedia.org/wiki/Spiral of Theodorus

Jason Dyer Staff - 4 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...