Can You Prove the Volume of an N-Dimensional Trianglehedron?

  • Thread starter T@P
  • Start date
In summary, the volume of an n-dimensional convex hull formed by orthogonal unit vectors is equal to 1/n!. This can be proven through induction and integration by slicing.
  • #1
T@P
274
0
if you take two unit orthogonal vectors in R2, the triangle they form has area 1/2. take 3 in R3, the volume is 1/6. i claim (and half proved) that the voluarea of an n dimensional bunch of orthognal vectors would give you 1/n!. can anyone prove it fully?

(go easy on the linear algebra, I am infantile when it comes to that)
 
Physics news on Phys.org
  • #2
I take it you mean the n-volume of the convex hull formed by the origin and the usual unit vectors in [itex]\Re^n[/itex] under the usual metric.

Let's instead of looking at just the unit length version, look at [itex]v_n(r)[/itex] the 'trianglehedron' with legs of length [itex]r[/itex].

Now, let's prove by induction that
[tex]v_n(r)=\frac{1}{n!} r^n[/tex]
Then it's easy to see that
[tex]v_1(r)=\frac{1}{n!} r^1[/tex]
And that for the n+1 case, we can integrate by slicing to get:
[tex]v_{n+1}(r)=\int_0^rv_n(x)dx[/tex]
but from induction we have:
[tex]v_n(x)=\frac{1}{n!}x^n[/tex]
so
[tex]v_{n+1}(r)=\int_0^r\frac{1}{n!}x^n dx[/tex]
which readily works out to
[tex]v_{n+1}(r)=\frac{1}{n!} \times \frac{1}{n+1} r^{n+1}=\frac{1}{(n+1)!}r^{n+1}[/tex]

Sepecifically,
[tex]v_n(1)=\frac{1}{n!}[/tex]
 
  • #3


The concept of a "N-dimensional trianglehedron" is not a commonly used term in mathematics. However, based on the description provided, it seems to refer to a geometric shape formed by a set of orthogonal vectors in N-dimensional space.

The statement that the volume or area of this shape is related to the factorial of the dimension (n!) is an interesting observation. It is true that in a two-dimensional space, the area of a triangle formed by two orthogonal unit vectors is 1/2, and in a three-dimensional space, the volume of the shape formed by three orthogonal unit vectors is 1/6. This pattern can be extended to higher dimensions as well.

To prove this, we can use the concept of determinants in linear algebra. The determinant of a square matrix is a scalar value that represents the "size" of the matrix. In two dimensions, the determinant of a matrix is equal to the area of the parallelogram formed by the two column vectors of the matrix. In three dimensions, the determinant of a matrix is equal to the volume of the parallelepiped formed by the three column vectors of the matrix.

Now, in N-dimensional space, the volume of the shape formed by N orthogonal unit vectors can be calculated using the determinant of a N x N matrix, where each column represents one of the unit vectors. The determinant of this matrix will be equal to the volume of the N-dimensional shape, which is 1/n! times the volume of a unit cube (where n is the dimension).

To prove this fully, we can use mathematical induction. The base case is n=2, where the determinant of a 2 x 2 matrix is equal to the area of the shape formed by two orthogonal unit vectors, which is 1/2. For the inductive step, assume that this statement is true for n=k. Then, for n=k+1, the determinant of a (k+1) x (k+1) matrix will be equal to 1/(k+1)! times the volume of a unit cube, which is 1/(k+1)! times 1/k!. This simplifies to 1/(k+1)!, proving the statement for n=k+1.

In conclusion, the volume or area of a N-dimensional shape formed by orthogonal unit vectors is indeed related to the factorial of the dimension (n!). This can be proven using the concept of determinants and mathematical induction.
 

FAQ: Can You Prove the Volume of an N-Dimensional Trianglehedron?

What is an N-dimensional trianglehedron?

An N-dimensional trianglehedron is a geometric shape that exists in N dimensions, where N is any positive integer. It is composed of N triangular faces that intersect at N vertices.

How is an N-dimensional trianglehedron different from a regular triangle?

An N-dimensional trianglehedron is different from a regular triangle in that it exists in multiple dimensions, while a regular triangle only exists in two dimensions. Additionally, an N-dimensional trianglehedron has N triangular faces and N vertices, while a regular triangle has three of each.

Can an N-dimensional trianglehedron exist in the real world?

No, an N-dimensional trianglehedron cannot exist in the physical world as we know it, as it would require more than the three dimensions that we currently experience. However, it can be studied and visualized in mathematical and computer simulations.

What are some real-world applications of N-dimensional trianglehedrons?

N-dimensional trianglehedrons have applications in fields such as computer graphics, computer science, and topology. They can also be used to study and understand higher dimensional spaces and shapes.

How is an N-dimensional trianglehedron represented mathematically?

An N-dimensional trianglehedron can be represented mathematically using coordinates and equations in N-dimensional space. It can also be represented using matrices and vectors in linear algebra.

Similar threads

Replies
1
Views
1K
Replies
4
Views
1K
Replies
5
Views
1K
Replies
27
Views
2K
Replies
12
Views
1K
Back
Top