Proving the Converse: Is H a Hyperplane?

  • Thread starter Thread starter psholtz
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on proving that a set H is a hyperplane in a vector space K of dimension n, given that for any x, y in H, the linear combination αx + (1-α)y also belongs to H for all α. The proof is divided into two parts: the forward direction, which establishes that the linear combination is in H, and the converse direction, which demonstrates that if the condition holds, H must be a hyperplane. The key concepts include linear subspaces, hyperplanes, and the properties of linear combinations within vector spaces.

PREREQUISITES
  • Understanding of vector spaces and their dimensions
  • Familiarity with linear subspaces and hyperplanes
  • Knowledge of linear combinations and their properties
  • Basic concepts of linear algebra, including the definitions of homogeneous and inhomogeneous solutions
NEXT STEPS
  • Study the properties of linear subspaces in vector spaces
  • Learn about the geometric interpretation of hyperplanes in R^n
  • Explore the implications of linear combinations in vector spaces
  • Investigate the relationship between homogeneous and inhomogeneous systems of linear equations
USEFUL FOR

Students of linear algebra, mathematicians exploring vector space theory, and anyone interested in the geometric properties of hyperplanes and linear combinations.

psholtz
Messages
133
Reaction score
0

Homework Statement


I'm working on a problem involving hyperplanes and factor spaces. It involves a bit of setup. I'll describe first the definitions. Suppose you have a vector space K, of dimension n. Suppose you have a linear subspace L of K. Choose a vector x_0 \in K, then the hyperplane H can be defined as the set of all x such that:

x = x_0 + y

where y ranges over the linear space L.

In simple terms, suppose we are working in R2. Then the line y=x+1 would be a hyperplane of dimension 1 (w/ "offset" vector x0=1), while the line y=x would be a linear subspace of R2.

This correlates roughly w/ the idea of homogeneous and inhomogeneous solutions to a linear system (or linear differential equation). The solution space of all x of the linear system Ax=0 is a linear space, and the "particular" solution would derived from Ax=b. The "total" solution of the inhomogeneous system would then be the "particular" solution + the linear system to the homogeneous system.

The problem statement is: given x,y \in H where H is a hyperplane in a vector space K of dimension n. Then prove that \alpha x + (1-\alpha)y \in H for all \alpha. Conversely, supposing this condition to be true for some subset H of K, prove that H must be a hyperplane.

Homework Equations


See above.

The Attempt at a Solution


The "forward" direction of the proof is simple enough, I'll give it below. The converse direction is what I find a bit trickier, and I'll post it in the next post. What I'm looking for is feedback as to whether my "converse" proof is correct or not.

Going forward, take two elements x,y \in H, that is to say:

x = x_0 + z_1

y = x_0 + z_2

where

z_1,z_2 \in L

(i.e., z1 and z2 are elements of the linear space L).

Then:

\alpha x + (1-\alpha) y = \alpha x_0 + \alpha z_1 + x_0 + z_2 - \alpha x_0 - \alpha z_2

= x_0 + z_2 + \alpha z_1 - \alpha z_2

Since

z_3 = z_2 + \alpha (z_1 - z_2) \in L

we can write this expression as:

\alpha x + (1-\alpha)y = x_0 + z_3

and so yes, the linear combination is in the hyperplane.

Going in the converse direction is what I'll post below, and what I'd like feedback on.
 
Last edited:
Physics news on Phys.org
OK, so suppose we have a set H such that given x,y \in H, we know that \alpha x + (1-\alpha)y \in H for all alpha.

The object is to prove that H is a hyperplane.

Note that this equation can be rewritten as:

y + \alpha(x-y) \in H

So if we can prove that the difference between two elements x,y \in H forms a linear space, we will know that H is a hyperplane.

Let x, y range over the entire set H, and consider their difference. Designate this set (i.e., the set of their differences) as M. That is:

x,y \in H \implies x-y \in M

Clearly, 0 \in M, since we can choose y=x, and x-x=0 for all x in K.

Likewise, consider x,y,z \in H. Clearly we have:

x-y \in M

y-z \in M

and

x-z \in M

all by definition. But also:

x-z = (x-y) + (y-z)

and so given any two elements in M, the linear combination formed by adding them together is likewise an element of M.

Finally, choose x,y,z \in H. From the condition we are given on H, we know that:

v_1 = y + \alpha (x-y) \in H

v_2 = z + \alpha (x-z) \in H

Now consider the difference v_1-v_2. Clearly, since v_1, v_2 \in H, we must have:

v_1-v_2 \in M

But likewise:

v_1 - v_2 = y-z + \alpha (z-y) = (1-\alpha)(y-z) \in M

and this must hold for all alpha. Let 1-\alpha = \alpha', we can may now write:

y,z \in H \implies \alpha'(y-z) \in M

which must hold for all \alpha', and we conclude that M must be a linear space.

Since M is a linear space, we conclude that the subset H is actually a hyperplane, as desired.

My reason for posting is to see whether you agree? Is this proof good?
 

Similar threads

Replies
26
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
8
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
5K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 36 ·
2
Replies
36
Views
6K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K