Munkres-Analysis on Manifolds: Theorem 20.1

Click For Summary

Discussion Overview

The discussion revolves around a proof from Munkres' "Analysis on Manifolds," specifically Theorem 20.1, which relates to the volume of the image of a rectifiable set under a linear transformation represented by an n by n matrix. Participants explore the implications of the transformation being non-singular versus singular, and the conditions under which certain properties hold, such as boundedness and measure.

Discussion Character

  • Technical explanation
  • Conceptual clarification
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant expresses understanding of the proof for non-singular matrices but seeks clarification on the singular case, particularly regarding the boundedness of h(S) and the measure of its closure.
  • Another participant suggests demonstrating that the x-axis in R^2 can be covered by rectangles of diminishing area to illustrate a point about measure.
  • Some participants note that linear transformations between finite-dimensional spaces are continuous and bounded, which addresses the boundedness question raised.
  • There is a discussion about the definition of boundedness in the context of linear transformations, with one participant asserting that boundedness can be claimed for the range if the domain is compact.
  • Clarifications are made regarding the meaning of "bounded" in relation to the image of the unit sphere under a linear transformation.

Areas of Agreement / Disagreement

Participants generally agree on the continuity and boundedness of linear transformations, but there remains uncertainty regarding the specific proof details and implications for measure in the singular case. The discussion does not reach a consensus on all points raised.

Contextual Notes

Participants express varying levels of familiarity with the prerequisites for understanding the material, indicating potential gaps in background knowledge that may affect their comprehension of the proof.

Who May Find This Useful

This discussion may be useful for students studying analysis on manifolds, particularly those grappling with the implications of linear transformations and measure theory in the context of rectifiable sets.

Bill2500
Messages
10
Reaction score
2
Hello. I am studying Analysis on Manifolds by Munkres. I have a problem with a proof in section 20. It states that:

Let A be an n by n matrix. Let h:R^n->R^n be the linear transformation h(x)=A x. Let S be a rectifiable set (the boundary of S BdS has measure 0) in R^n. Then v(h(S))=|detA|v(S) (v=volume).

The author starts his proof by considering tha case of A being a non-singular matrix (invertible).
I think I understand his steps in that case (I basically had to prove that h(intS)=int h(S) and h(S) is rectifiable, if anybody knows a way this statements are proven autumatically please tell me).

He proceeds by considering the case where A is singular, so detA=0. He tries to show now that v(T)=0. He states that since S is bounded so is h(S) (I think that's true because |h(x)-h(a)|<=n|A|*|x-a| for each x in S and fixed a in S, if there is again a better explanation please tell me).

Then he says that h(R^n)=V with dimV=p<n and that V has measure 0 (for each ε>0 it can be covered by countably many open rectangles of total volume less than ε), a statemant that I have no clue how to prove. Then he says that the closure of h(S)=cl h(S) is closed and bounded and has neasure 0 (of course cl h(S) is closed but why is it bounded with measure 0?). Then makes an addition step (which I understand) and proves the theorem for that case too.

Cound someone help me clarify the points of the proof that I don't understand? Thank you in advance!
 
Physics news on Phys.org
try showing that the x-axis in R^2 can be covered by a sequence of rectangles of total area < 1. e.g. take them all of base 1, and make the height of the one whose base goes from n to n+1 something like 1/2^(n+2). or whatever works.

by the way have you had a calculus course at the level of spivak? i ask because it seems this analysis on manifolds course is a little beyond your training. of course one can always catch up in time.
 
You have a linear transformation between finitedimensional spaces. Such transformation is always continuous, or equivalently, bounded. This explains the boundedness part in your question.
 
mathwonk said:
try showing that the x-axis in R^2 can be covered by a sequence of rectangles of total area < 1. e.g. take them all of base 1, and make the height of the one whose base goes from n to n+1 something like 1/2^(n+2). or whatever works.

by the way have you had a calculus course at the level of spivak? i ask because it seems this analysis on manifolds course is a little beyond your training. of course one can always catch up in time.
I have had a course in one variable at a level a bit higher than Spivak and a (slightly less rigorous) course in multivariable course. I am studying this book to proceed to Spivak's Differential Geometry books but I am having second thoughts. Seeing how much topology Munkres' proofs have I am thinking of studying his topology book instead.
 
Math_QED said:
You have a linear transformation between finitedimensional spaces. Such transformation is always continuous, or equivalently, bounded. This explains the boundedness part in your question.
I thought boundedness is something I can claim for a range if I have fa compact domain.
 
for a linear transformation T the meaning of "bounded" is that the image of the unit sphere is a bounded set. equivalently there is a finite bound C such that for every vector v we have |Tv| ≤ C|v|, where | | denotes the length of a vector
 
  • Like
Likes   Reactions: Bill2500

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K