MHB Equation of a plane determined by three or four points in R4

Rorschach
Messages
10
Reaction score
0
How do you find the equation of a plane in determined by say three or four points in $\mathbb{R}^4$?

In $\mathbb{R}^{3}$ we would use the cross product to find normal vector, but that doesn't apply in $\mathbb{R}^4$.
 
Physics news on Phys.org
Exactly what do you mean by a "plane" in four dimensions? A two dimensional, flat, surface or a three dimensional, flat, subspace?

If you mean a two dimensional surface then it can be determined by three points. Calling the extra dimension "t", we can write the plane as x= Au+ Bv+ C, y= Du+ Ev+ F, z= Gu+ Hv+ I, t= Ju+ Kv+ L. That is, since it is two dimensional it can be written in terms of two parameters and since it is a plane those functions can be taken to be linear. Given three points, [math](x_1, y_1, z_1, t_1)[/math], [math](x_2, y_2, z_2, t_2)[/math] and [math](x_3, y_3, z_3, t_3)[/math], and taking parameters u and v such that the first point corresponds to u= 0, v= 0, the second to u= 1, v= 0, and the third to u= 0. v= 1 we have 12 linear equations
[math]x_1= C[/math]
[math]y_1= F[/math]
[math]z_1= I[/math]
[math]t_1= L[/math]
[math]x_2= A+ C[/math]
[math]y_2= D+ F[/math]
[math]z_2= G+ I[/math]
[math]t_2= J+ L[/math]
[math]x_3= B+ C[/math]
[math]y_3= E+ F[/math]
[math]z_3= H+ I[/math]
[math]t_3= K+ L[/math]
to solve for the 12 coefficients.

If you mean a three dimensional subspace of the four dimensional space you will need four points. A three dimensional subspace will require three parameters. Now we would write, in parametric equations
[math]x= Au+ Bv+ Cw+ D[/math]
[math]y= Eu+ Fv+ Gw+ H[/math]
[math]z= Iu+ Jv+ Kw+ L[/math]
[math]t= Mu+ Nv+ Ow+ P[/math].
Taking the four points to correspond to parameters u= v= w= 0; u= 1, v= w= 0; v= 1, u= w= 0; and w= 1, u= v= 0, we have a total of 16 linear equations to solve for the 16 coefficients.
 
Rorschach said:
How do you find the equation of a plane in determined by say three or four points in $\mathbb{R}^4$?

In $\mathbb{R}^{3}$ we would use the cross product to find normal vector, but that doesn't apply in $\mathbb{R}^4$.

Hi Rorschach,

There is a generalized cross product.
For 4 dimensions it is:
$$\mathbf n = \begin{vmatrix}a_1&a_2&a_3&a_4 \\ b_1&b_2&b_3&b_4 \\ c_1&c_2&c_3&c_4 \\ \mathbf e_1&\mathbf e_2&\mathbf e_3&\mathbf e_4\end{vmatrix} \tag 1$$
where $\mathbf e_i$ are the standard unit vectors, and where $|\cdot|$ denotes the determinant.
The result $\mathbf n$ is a vector that is perpendicular to $\mathbf a, \mathbf b$, and $\mathbf c$.

We can use it to find the equation of a hyperplane, which is a 3D plane in 4 dimensions.More generally, suppose $\mathbf v_1, ..., \mathbf v_k$ are the vectors that span a plane.
Then we can find the normal vectors by solving $\mathbf v_1 \cdot \mathbf n = 0, ..., \mathbf v_k \cdot \mathbf n = 0$.
Or in matrix notation:
$$\begin{bmatrix}\mathbf v_1 & ... & \mathbf v_k\end{bmatrix}^T\mathbf n = 0 \tag 2$$
We can solve it for instance with Gaussian elimination.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top