Interior and boundary of set of orthogonal vectors

Click For Summary
SUMMARY

The discussion focuses on the mathematical properties of the set S defined as S = { x in R^n | "a" · "x" = 0}, where "a" is a non-zero vector in R^n. It concludes that the interior of S is empty, the boundary consists of all points in the (n-1)-dimensional plane orthogonal to "a", and the closure of S includes all boundary points. The examples provided for n=2 and n=3 illustrate these properties clearly, confirming that the interior is empty while the boundary and closure coincide with the defined set.

PREREQUISITES
  • Understanding of vector spaces and orthogonality in R^n
  • Familiarity with concepts of interior, boundary, and closure in topology
  • Knowledge of triangle inequality and its applications in proofs
  • Basic proficiency in mathematical notation and set theory
NEXT STEPS
  • Study the properties of vector spaces in R^n, focusing on orthogonal sets
  • Learn about topological concepts such as interior, boundary, and closure
  • Explore examples of orthogonal projections and their geometric interpretations
  • Investigate the implications of dimensionality in vector spaces and their boundaries
USEFUL FOR

Mathematicians, students studying linear algebra, and anyone interested in the geometric properties of vector spaces and orthogonality in R^n.

trap101
Messages
339
Reaction score
0
Let "a" be a non zero vector in R^n and define S = { x in R^n s.t. "a" · "x" = 0}. Determine S^int , bkundary of S, and closure of S. Prove your answer is correct


Attempt:

Ok I am more sk having trouble proving that the respective points belong to its condition. Such as thr interior. I know will be all points in thr plane of X, but how can i show that all thise points are the interior if S? All i can think of is letting a point, call it "y", be in thr B(r,a) and showing that it is a interior point through the triangle inequality manipulation. But that doesn't use the fact of orthogonality in the set.
 
Physics news on Phys.org
If a is a single vector in Rn, then the set of all vectors that are orthogonal to a is an n-1 dimensional "plane". You shouldn't have to use any "neighborhoods" or other technical details.

When in doubt, look at simple variations of the problem. Suppose n= 2 and a= <1, 0>. The the set of all vectors orthogonal to a is {<0, y>} for any y- the entire y- axis. What are the boundary, interior, and closure of the y- axis? Suppose n= 3 and a= <0, 0, 1>. The set of all vectors orthogonal to a is {<x, y, 0>} for any x and y- the xy-plane. What are the boundary, interior, and closure of the xy-plane?
 
ok, well using the examples you gave. The boundary, interior, and closure for n= 2: y- axis is the boundary, empty interior, and y-axis is the points in the closure.

Now I tried extending it to n-1 imagining a plane and I got a similar result I believe:

Boundary would be all points in the n-1 plane, interior would be empty, and the closure would be all the boundary points
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
11
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
6
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K