Open sets preserved in linear transformation that isn't bijective?

Click For Summary

Discussion Overview

The discussion centers around the properties of linear transformations between R3 and R2, specifically regarding the mapping of open sets under such transformations. Participants explore the implications of these mappings when the transformation is not bijective and consider related theorems and concepts, such as the open mapping theorem and connectedness.

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • One participant questions whether open sets in R3 are mapped to open sets in R2 under a linear transformation, particularly when the transformation is not one-to-one or onto.
  • Another participant suggests looking into the open mapping theorem as a potential resource for understanding this mapping.
  • A different participant expresses a desire to extend the discussion to the pre-image of open sets, questioning if it must also be an open set, and notes that this might imply the need for an inverse transformation.
  • Concerns are raised about the ethical implications of seeking help on online forums for research-related questions, with one participant suggesting that it is best to consult with those who assigned the research.
  • A later reply mentions that a linear map must be of maximal rank to be open, indicating that if the dimensions of the spaces differ, the mapping properties change.

Areas of Agreement / Disagreement

Participants express various viewpoints regarding the mapping of open sets and the conditions under which these properties hold. There is no consensus on the implications of non-bijective transformations or the necessity of inverses for pre-images of open sets.

Contextual Notes

Some participants note that the proof regarding the openness of linear maps is elementary and depends on the rank of the transformation, but the discussion remains open to further exploration of these concepts.

Who May Find This Useful

This discussion may be useful for students and researchers interested in linear algebra, topology, and the properties of transformations in mathematical analysis.

dumbQuestion
Messages
124
Reaction score
0
Hi, I'm not sure how else to phrase this.Let's say I have a linear transformation from R3 to R2. Let's assume in both spaces, I am using the standard topology with the standard euclidean distance metric. Does this mean that open sets in R3 will be mapped to open sets in R2 under this transformation? What if the transformation is not one to one or onto?

If this is the case, I am not asking anyone to prove this to me but rather if you have any ideas what theorems I might look at to prove this myself? I was thinking connectedness would come into play. Am I right in that assumption?Thanks so much!
 
Physics news on Phys.org
Oh wow! Thank you for the quick reply! This is EXACTLY what I'm looking for!
 
I have one other question. Do you know if we can extend this thought? Say, the only way to map to an open set is from an open set? I'm not sure how to phrase it. I guess what I'm thinking is say, the pre-image of an open set, must is be an open set? But that would mean our transformation needs to have an inverse right?Here's my situation, maybe that will make my question clear. I keep coming across two scenarios in my research. Sometimes I am dealing with open sets in R^3 and I am mapping them to R^2 using a linear transformation. I wanted to know that the image of these open sets was an open set in R^2 and the theorem you provided seems to confirm that. But sometimes I am dealing with these unbounded regions in R^3 (for example I'll have something like a region that includes all points that lie above a given plane). I am still mapping these regions using the same linear transformation as before and I want to know that these unbounded regions map to unbounded region of R^2. I mean that's what makes sense to me and it seems like it should be obvious but I don't want to make any assumptions!EDIT: it just dawned on me, is it ethical to ask for help on an online forum regarding my research? I am not sure if I'm "allowed" to do that? I am really new to research so I'm not sure about that
 
Last edited:
dumbQuestion said:
I
EDIT: it just dawned on me, is it ethical to ask for help on an online forum regarding my research? I am not sure if I'm "allowed" to do that? I am really new to research so I'm not sure about that
The only way to answer that is to ask the people who have assigned you this research. I presume they gave it to you in order that you learn how to do research, and searching the internet is a form of research but they may want you to learn specific kinds of research in a specific order. Just as a teacher may ask a student to use the quadratic formula that could, in fact, be solved more easily by factoring, just to practice using the quadratic formula, so your teacher(s) may want you to focus first on searching books and journals, leaving the internet to later. But the only way to know is to ask them.
 
dumbQuestion said:
Hi, I'm not sure how else to phrase this.Let's say I have a linear transformation from R3 to R2. Let's assume in both spaces, I am using the standard topology with the standard euclidean distance metric. Does this mean that open sets in R3 will be mapped to open sets in R2 under this transformation? What if the transformation is not one to one or onto?

If this is the case, I am not asking anyone to prove this to me but rather if you have any ideas what theorems I might look at to prove this myself? I was thinking connectedness would come into play. Am I right in that assumption?Thanks so much!

The linear map must be of maximal rank. The proof is elementary. In general if m < n then a linear map fron n space to m space is open if it is of maximal rank. If m > n, then it is not open.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 52 ·
2
Replies
52
Views
7K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K