In an n-dimensional space, how many vectors construct a hyperplane?

My guess is n, because a line in R^2 is a hyperplane and a plane in R^3 is a hyperplane. But how can I prove this?

Printable View

- November 25th 2011, 07:34 AMnorickaHyperplane
In an n-dimensional space, how many vectors construct a hyperplane?

My guess is n, because a line in R^2 is a hyperplane and a plane in R^3 is a hyperplane. But how can I prove this? - November 25th 2011, 08:16 AMDevenoRe: Hyperplane
n-1, not n.

a hyperplane is defined by a single equation of the form:

, where not all are 0.

the solution set consists of all elements of the solution space of the associated homogeneous system:

, plus any (particular) vector lying on the hyperplane

(in other words we have a coset, or translate, of the nullspace of the homogeneous system).

since the homogeneous system has rank 1, its solution space has dimension n-1 (by the rank-nullity theorem), therefore.... - November 28th 2011, 04:20 AMnorickaRe: Hyperplane
Thank you very much!

- November 28th 2011, 06:13 AMHallsofIvyRe: Hyperplane
What, exactly, do you mean by "construct a plane"? In n dimensional space, there will be, pretty much by definition, n-1 independent vectors lying on a hyperplane

**through the origin**. But there will be**no**vectors lying on a hyper plane [b]not[/b ] through the origin. There is, however, always**one**vector**perpendicular**to the given hyperplane and that can be used to write the equation of the plane.

As Deveno said, any hyperplane can be written as , where is a vector normal to the hyperplane and is a point in the hyperplane.