Do we assume $f_n$'s map into $Bbb{R}$ or $Bbb{C}$ in Theorem 7.8 Rudin's *Principles of Mathematical...
$begingroup$
Theorem 7.8 The sequence of functions ${f_n}$ defined on $E$ converges uniformly on $E$ if and only if for every $epsilon > 0$ there exists an integer $N$ such that $m geq N, n geq N, x in E$ implies
begin{equation}
|f_n(x)-f_m(x)| leq epsilon
end{equation}
For the backwards direction, since the codomain of $f$ is not given, how can we use Theorem 3.11 (Cauchy sequence in a compact metric space (or $mathbb{R}^k$) converges to some point in the metric space) to prove pointwise convergence of $f$?
real-analysis
$endgroup$
add a comment |
$begingroup$
Theorem 7.8 The sequence of functions ${f_n}$ defined on $E$ converges uniformly on $E$ if and only if for every $epsilon > 0$ there exists an integer $N$ such that $m geq N, n geq N, x in E$ implies
begin{equation}
|f_n(x)-f_m(x)| leq epsilon
end{equation}
For the backwards direction, since the codomain of $f$ is not given, how can we use Theorem 3.11 (Cauchy sequence in a compact metric space (or $mathbb{R}^k$) converges to some point in the metric space) to prove pointwise convergence of $f$?
real-analysis
$endgroup$
$begingroup$
Is one conclusion true and the other false?
$endgroup$
– Robert Wolfe
Dec 6 '18 at 14:12
add a comment |
$begingroup$
Theorem 7.8 The sequence of functions ${f_n}$ defined on $E$ converges uniformly on $E$ if and only if for every $epsilon > 0$ there exists an integer $N$ such that $m geq N, n geq N, x in E$ implies
begin{equation}
|f_n(x)-f_m(x)| leq epsilon
end{equation}
For the backwards direction, since the codomain of $f$ is not given, how can we use Theorem 3.11 (Cauchy sequence in a compact metric space (or $mathbb{R}^k$) converges to some point in the metric space) to prove pointwise convergence of $f$?
real-analysis
$endgroup$
Theorem 7.8 The sequence of functions ${f_n}$ defined on $E$ converges uniformly on $E$ if and only if for every $epsilon > 0$ there exists an integer $N$ such that $m geq N, n geq N, x in E$ implies
begin{equation}
|f_n(x)-f_m(x)| leq epsilon
end{equation}
For the backwards direction, since the codomain of $f$ is not given, how can we use Theorem 3.11 (Cauchy sequence in a compact metric space (or $mathbb{R}^k$) converges to some point in the metric space) to prove pointwise convergence of $f$?
real-analysis
real-analysis
edited Dec 6 '18 at 13:03
Brahadeesh
6,22242361
6,22242361
asked Dec 28 '16 at 14:04
RubyRuby
965
965
$begingroup$
Is one conclusion true and the other false?
$endgroup$
– Robert Wolfe
Dec 6 '18 at 14:12
add a comment |
$begingroup$
Is one conclusion true and the other false?
$endgroup$
– Robert Wolfe
Dec 6 '18 at 14:12
$begingroup$
Is one conclusion true and the other false?
$endgroup$
– Robert Wolfe
Dec 6 '18 at 14:12
$begingroup$
Is one conclusion true and the other false?
$endgroup$
– Robert Wolfe
Dec 6 '18 at 14:12
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
For each $x in E$, the sequence $(f_n(x))_{n in mathbb N}$ is a Cauchy-sequence in $ mathbb R$ or ($mathbb C$).
$endgroup$
$begingroup$
So do we assume that $f_n(x)$'s are functions that map into the real/complex space? Also, what does it mean by $mathbb{R}(mathbb(C))$?
$endgroup$
– Ruby
Dec 29 '16 at 1:27
$begingroup$
It means that the second sentence on page 148 states that the sequence of points in $mathcal{C}$ converges. Points = values of complex-valued functions, or in other words ${f_n}$ converges pointwise in $mathcal{C}$ because it is a Cauchy sequence, as in Theorem 3.11
$endgroup$
– Mikhail D
May 20 '17 at 13:24
$begingroup$
@Ruby $mathbb{R}((C))$ is a typo, I have made the correction to the answer and it should be clear now. And, yes we assume that $f_n$'s are functions that map into the real/complex space.
$endgroup$
– Brahadeesh
Dec 6 '18 at 12:59
add a comment |
$begingroup$
From Chapter 1:
1.38 Remarks Theorem 1.37 (a), (b), and (f) will allow us (see Chap. 2) to regard $R^k$ as a metric space. $R^1$ (the set of all real numbers) is usually called the line, or the real line. Likewise, $R^2$ is called the plane, or the complex plane (compare Definitions 1.24 and 1.36). In these two cases the norm is just the absolute value of the corresponding real or complex number.
From Chapter 2:
2.16 Examples The most important examples of metric spaces, from our standpoint, are the euclidean spaces $R^k$, especially $R^1$ (the real line) and $R^2$ (the complex plane); the distance in $R^k$ is defined by
$text{(19)} quad quad d(x. y) = |x — y| ; ; ; text{ with } x, y in R^k$
By Theorem 1.37. the conditions of Definition 2.15 are satisfied by (19).
If you were reading Rudin in self-study mode, you might have to use the index to find complex plane. I tried to put myself in the OP's shoes and saw the term right under complex number.
But, it does seem unfair for Rudin to bury theory inside remarks and examples.
It is a bit humorous how in the remark Rudin writes
$R^1$ (the set of all real numbers) is usually called the line, or the real line.
and in the next sentence states
Likewise, $R^2$ is called the plane, or the complex plane
Apparently the definition of complex plane can be found in a remark that it will all make sense in the next chapter. And if we call $R^2$ a plane then that means we are examining Euclidean 2-space.
Rudin wasn't using latex, representing the real numbers with $R$ while not using any symbol for the complex plane; see the LIST OF SPECIAL SYMBOLS at the end of the book
$endgroup$
add a comment |
$begingroup$
I cannot quickly scan the whole text to check all references to 7.8. Based on the contents of chapter Uniform convergence and continuity (pages 149-151), Theorem 7.8 is used to prove Theorem 7.15, which is essentially about complex-valued, bounded and continuous functions $mathcal{C}(X)$.
Theorem 3.11 is about metric spaces that are either compact, $mathcal{R}^n$ or $mathcal{C}$.
So $E$ in Theorem 7.8 is a typo. Actually, it should be $mathcal{C}$ as we are dealing with complex-valued functions.
Yes, this book had 3 editions, so many views, but no mention of this bit in errata.
Errata from George Bergman does not include this error https://math.berkeley.edu/~gbergman/ug.hndts/m104_Rudin_notes.pdf
Notes from Jiří Lebl point to complex-valued functions for Theorem 7.8, page 3 of 21 in PDF
https://math.okstate.edu/people/lebl/uw522-s12/lec1.pdf
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2074779%2fdo-we-assume-f-ns-map-into-bbbr-or-bbbc-in-theorem-7-8-rudins-pri%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
For each $x in E$, the sequence $(f_n(x))_{n in mathbb N}$ is a Cauchy-sequence in $ mathbb R$ or ($mathbb C$).
$endgroup$
$begingroup$
So do we assume that $f_n(x)$'s are functions that map into the real/complex space? Also, what does it mean by $mathbb{R}(mathbb(C))$?
$endgroup$
– Ruby
Dec 29 '16 at 1:27
$begingroup$
It means that the second sentence on page 148 states that the sequence of points in $mathcal{C}$ converges. Points = values of complex-valued functions, or in other words ${f_n}$ converges pointwise in $mathcal{C}$ because it is a Cauchy sequence, as in Theorem 3.11
$endgroup$
– Mikhail D
May 20 '17 at 13:24
$begingroup$
@Ruby $mathbb{R}((C))$ is a typo, I have made the correction to the answer and it should be clear now. And, yes we assume that $f_n$'s are functions that map into the real/complex space.
$endgroup$
– Brahadeesh
Dec 6 '18 at 12:59
add a comment |
$begingroup$
For each $x in E$, the sequence $(f_n(x))_{n in mathbb N}$ is a Cauchy-sequence in $ mathbb R$ or ($mathbb C$).
$endgroup$
$begingroup$
So do we assume that $f_n(x)$'s are functions that map into the real/complex space? Also, what does it mean by $mathbb{R}(mathbb(C))$?
$endgroup$
– Ruby
Dec 29 '16 at 1:27
$begingroup$
It means that the second sentence on page 148 states that the sequence of points in $mathcal{C}$ converges. Points = values of complex-valued functions, or in other words ${f_n}$ converges pointwise in $mathcal{C}$ because it is a Cauchy sequence, as in Theorem 3.11
$endgroup$
– Mikhail D
May 20 '17 at 13:24
$begingroup$
@Ruby $mathbb{R}((C))$ is a typo, I have made the correction to the answer and it should be clear now. And, yes we assume that $f_n$'s are functions that map into the real/complex space.
$endgroup$
– Brahadeesh
Dec 6 '18 at 12:59
add a comment |
$begingroup$
For each $x in E$, the sequence $(f_n(x))_{n in mathbb N}$ is a Cauchy-sequence in $ mathbb R$ or ($mathbb C$).
$endgroup$
For each $x in E$, the sequence $(f_n(x))_{n in mathbb N}$ is a Cauchy-sequence in $ mathbb R$ or ($mathbb C$).
edited Dec 6 '18 at 13:00
Brahadeesh
6,22242361
6,22242361
answered Dec 28 '16 at 14:27
FredFred
45.2k1847
45.2k1847
$begingroup$
So do we assume that $f_n(x)$'s are functions that map into the real/complex space? Also, what does it mean by $mathbb{R}(mathbb(C))$?
$endgroup$
– Ruby
Dec 29 '16 at 1:27
$begingroup$
It means that the second sentence on page 148 states that the sequence of points in $mathcal{C}$ converges. Points = values of complex-valued functions, or in other words ${f_n}$ converges pointwise in $mathcal{C}$ because it is a Cauchy sequence, as in Theorem 3.11
$endgroup$
– Mikhail D
May 20 '17 at 13:24
$begingroup$
@Ruby $mathbb{R}((C))$ is a typo, I have made the correction to the answer and it should be clear now. And, yes we assume that $f_n$'s are functions that map into the real/complex space.
$endgroup$
– Brahadeesh
Dec 6 '18 at 12:59
add a comment |
$begingroup$
So do we assume that $f_n(x)$'s are functions that map into the real/complex space? Also, what does it mean by $mathbb{R}(mathbb(C))$?
$endgroup$
– Ruby
Dec 29 '16 at 1:27
$begingroup$
It means that the second sentence on page 148 states that the sequence of points in $mathcal{C}$ converges. Points = values of complex-valued functions, or in other words ${f_n}$ converges pointwise in $mathcal{C}$ because it is a Cauchy sequence, as in Theorem 3.11
$endgroup$
– Mikhail D
May 20 '17 at 13:24
$begingroup$
@Ruby $mathbb{R}((C))$ is a typo, I have made the correction to the answer and it should be clear now. And, yes we assume that $f_n$'s are functions that map into the real/complex space.
$endgroup$
– Brahadeesh
Dec 6 '18 at 12:59
$begingroup$
So do we assume that $f_n(x)$'s are functions that map into the real/complex space? Also, what does it mean by $mathbb{R}(mathbb(C))$?
$endgroup$
– Ruby
Dec 29 '16 at 1:27
$begingroup$
So do we assume that $f_n(x)$'s are functions that map into the real/complex space? Also, what does it mean by $mathbb{R}(mathbb(C))$?
$endgroup$
– Ruby
Dec 29 '16 at 1:27
$begingroup$
It means that the second sentence on page 148 states that the sequence of points in $mathcal{C}$ converges. Points = values of complex-valued functions, or in other words ${f_n}$ converges pointwise in $mathcal{C}$ because it is a Cauchy sequence, as in Theorem 3.11
$endgroup$
– Mikhail D
May 20 '17 at 13:24
$begingroup$
It means that the second sentence on page 148 states that the sequence of points in $mathcal{C}$ converges. Points = values of complex-valued functions, or in other words ${f_n}$ converges pointwise in $mathcal{C}$ because it is a Cauchy sequence, as in Theorem 3.11
$endgroup$
– Mikhail D
May 20 '17 at 13:24
$begingroup$
@Ruby $mathbb{R}((C))$ is a typo, I have made the correction to the answer and it should be clear now. And, yes we assume that $f_n$'s are functions that map into the real/complex space.
$endgroup$
– Brahadeesh
Dec 6 '18 at 12:59
$begingroup$
@Ruby $mathbb{R}((C))$ is a typo, I have made the correction to the answer and it should be clear now. And, yes we assume that $f_n$'s are functions that map into the real/complex space.
$endgroup$
– Brahadeesh
Dec 6 '18 at 12:59
add a comment |
$begingroup$
From Chapter 1:
1.38 Remarks Theorem 1.37 (a), (b), and (f) will allow us (see Chap. 2) to regard $R^k$ as a metric space. $R^1$ (the set of all real numbers) is usually called the line, or the real line. Likewise, $R^2$ is called the plane, or the complex plane (compare Definitions 1.24 and 1.36). In these two cases the norm is just the absolute value of the corresponding real or complex number.
From Chapter 2:
2.16 Examples The most important examples of metric spaces, from our standpoint, are the euclidean spaces $R^k$, especially $R^1$ (the real line) and $R^2$ (the complex plane); the distance in $R^k$ is defined by
$text{(19)} quad quad d(x. y) = |x — y| ; ; ; text{ with } x, y in R^k$
By Theorem 1.37. the conditions of Definition 2.15 are satisfied by (19).
If you were reading Rudin in self-study mode, you might have to use the index to find complex plane. I tried to put myself in the OP's shoes and saw the term right under complex number.
But, it does seem unfair for Rudin to bury theory inside remarks and examples.
It is a bit humorous how in the remark Rudin writes
$R^1$ (the set of all real numbers) is usually called the line, or the real line.
and in the next sentence states
Likewise, $R^2$ is called the plane, or the complex plane
Apparently the definition of complex plane can be found in a remark that it will all make sense in the next chapter. And if we call $R^2$ a plane then that means we are examining Euclidean 2-space.
Rudin wasn't using latex, representing the real numbers with $R$ while not using any symbol for the complex plane; see the LIST OF SPECIAL SYMBOLS at the end of the book
$endgroup$
add a comment |
$begingroup$
From Chapter 1:
1.38 Remarks Theorem 1.37 (a), (b), and (f) will allow us (see Chap. 2) to regard $R^k$ as a metric space. $R^1$ (the set of all real numbers) is usually called the line, or the real line. Likewise, $R^2$ is called the plane, or the complex plane (compare Definitions 1.24 and 1.36). In these two cases the norm is just the absolute value of the corresponding real or complex number.
From Chapter 2:
2.16 Examples The most important examples of metric spaces, from our standpoint, are the euclidean spaces $R^k$, especially $R^1$ (the real line) and $R^2$ (the complex plane); the distance in $R^k$ is defined by
$text{(19)} quad quad d(x. y) = |x — y| ; ; ; text{ with } x, y in R^k$
By Theorem 1.37. the conditions of Definition 2.15 are satisfied by (19).
If you were reading Rudin in self-study mode, you might have to use the index to find complex plane. I tried to put myself in the OP's shoes and saw the term right under complex number.
But, it does seem unfair for Rudin to bury theory inside remarks and examples.
It is a bit humorous how in the remark Rudin writes
$R^1$ (the set of all real numbers) is usually called the line, or the real line.
and in the next sentence states
Likewise, $R^2$ is called the plane, or the complex plane
Apparently the definition of complex plane can be found in a remark that it will all make sense in the next chapter. And if we call $R^2$ a plane then that means we are examining Euclidean 2-space.
Rudin wasn't using latex, representing the real numbers with $R$ while not using any symbol for the complex plane; see the LIST OF SPECIAL SYMBOLS at the end of the book
$endgroup$
add a comment |
$begingroup$
From Chapter 1:
1.38 Remarks Theorem 1.37 (a), (b), and (f) will allow us (see Chap. 2) to regard $R^k$ as a metric space. $R^1$ (the set of all real numbers) is usually called the line, or the real line. Likewise, $R^2$ is called the plane, or the complex plane (compare Definitions 1.24 and 1.36). In these two cases the norm is just the absolute value of the corresponding real or complex number.
From Chapter 2:
2.16 Examples The most important examples of metric spaces, from our standpoint, are the euclidean spaces $R^k$, especially $R^1$ (the real line) and $R^2$ (the complex plane); the distance in $R^k$ is defined by
$text{(19)} quad quad d(x. y) = |x — y| ; ; ; text{ with } x, y in R^k$
By Theorem 1.37. the conditions of Definition 2.15 are satisfied by (19).
If you were reading Rudin in self-study mode, you might have to use the index to find complex plane. I tried to put myself in the OP's shoes and saw the term right under complex number.
But, it does seem unfair for Rudin to bury theory inside remarks and examples.
It is a bit humorous how in the remark Rudin writes
$R^1$ (the set of all real numbers) is usually called the line, or the real line.
and in the next sentence states
Likewise, $R^2$ is called the plane, or the complex plane
Apparently the definition of complex plane can be found in a remark that it will all make sense in the next chapter. And if we call $R^2$ a plane then that means we are examining Euclidean 2-space.
Rudin wasn't using latex, representing the real numbers with $R$ while not using any symbol for the complex plane; see the LIST OF SPECIAL SYMBOLS at the end of the book
$endgroup$
From Chapter 1:
1.38 Remarks Theorem 1.37 (a), (b), and (f) will allow us (see Chap. 2) to regard $R^k$ as a metric space. $R^1$ (the set of all real numbers) is usually called the line, or the real line. Likewise, $R^2$ is called the plane, or the complex plane (compare Definitions 1.24 and 1.36). In these two cases the norm is just the absolute value of the corresponding real or complex number.
From Chapter 2:
2.16 Examples The most important examples of metric spaces, from our standpoint, are the euclidean spaces $R^k$, especially $R^1$ (the real line) and $R^2$ (the complex plane); the distance in $R^k$ is defined by
$text{(19)} quad quad d(x. y) = |x — y| ; ; ; text{ with } x, y in R^k$
By Theorem 1.37. the conditions of Definition 2.15 are satisfied by (19).
If you were reading Rudin in self-study mode, you might have to use the index to find complex plane. I tried to put myself in the OP's shoes and saw the term right under complex number.
But, it does seem unfair for Rudin to bury theory inside remarks and examples.
It is a bit humorous how in the remark Rudin writes
$R^1$ (the set of all real numbers) is usually called the line, or the real line.
and in the next sentence states
Likewise, $R^2$ is called the plane, or the complex plane
Apparently the definition of complex plane can be found in a remark that it will all make sense in the next chapter. And if we call $R^2$ a plane then that means we are examining Euclidean 2-space.
Rudin wasn't using latex, representing the real numbers with $R$ while not using any symbol for the complex plane; see the LIST OF SPECIAL SYMBOLS at the end of the book
edited Dec 6 '18 at 14:34
answered Dec 6 '18 at 13:46
CopyPasteItCopyPasteIt
4,1531628
4,1531628
add a comment |
add a comment |
$begingroup$
I cannot quickly scan the whole text to check all references to 7.8. Based on the contents of chapter Uniform convergence and continuity (pages 149-151), Theorem 7.8 is used to prove Theorem 7.15, which is essentially about complex-valued, bounded and continuous functions $mathcal{C}(X)$.
Theorem 3.11 is about metric spaces that are either compact, $mathcal{R}^n$ or $mathcal{C}$.
So $E$ in Theorem 7.8 is a typo. Actually, it should be $mathcal{C}$ as we are dealing with complex-valued functions.
Yes, this book had 3 editions, so many views, but no mention of this bit in errata.
Errata from George Bergman does not include this error https://math.berkeley.edu/~gbergman/ug.hndts/m104_Rudin_notes.pdf
Notes from Jiří Lebl point to complex-valued functions for Theorem 7.8, page 3 of 21 in PDF
https://math.okstate.edu/people/lebl/uw522-s12/lec1.pdf
$endgroup$
add a comment |
$begingroup$
I cannot quickly scan the whole text to check all references to 7.8. Based on the contents of chapter Uniform convergence and continuity (pages 149-151), Theorem 7.8 is used to prove Theorem 7.15, which is essentially about complex-valued, bounded and continuous functions $mathcal{C}(X)$.
Theorem 3.11 is about metric spaces that are either compact, $mathcal{R}^n$ or $mathcal{C}$.
So $E$ in Theorem 7.8 is a typo. Actually, it should be $mathcal{C}$ as we are dealing with complex-valued functions.
Yes, this book had 3 editions, so many views, but no mention of this bit in errata.
Errata from George Bergman does not include this error https://math.berkeley.edu/~gbergman/ug.hndts/m104_Rudin_notes.pdf
Notes from Jiří Lebl point to complex-valued functions for Theorem 7.8, page 3 of 21 in PDF
https://math.okstate.edu/people/lebl/uw522-s12/lec1.pdf
$endgroup$
add a comment |
$begingroup$
I cannot quickly scan the whole text to check all references to 7.8. Based on the contents of chapter Uniform convergence and continuity (pages 149-151), Theorem 7.8 is used to prove Theorem 7.15, which is essentially about complex-valued, bounded and continuous functions $mathcal{C}(X)$.
Theorem 3.11 is about metric spaces that are either compact, $mathcal{R}^n$ or $mathcal{C}$.
So $E$ in Theorem 7.8 is a typo. Actually, it should be $mathcal{C}$ as we are dealing with complex-valued functions.
Yes, this book had 3 editions, so many views, but no mention of this bit in errata.
Errata from George Bergman does not include this error https://math.berkeley.edu/~gbergman/ug.hndts/m104_Rudin_notes.pdf
Notes from Jiří Lebl point to complex-valued functions for Theorem 7.8, page 3 of 21 in PDF
https://math.okstate.edu/people/lebl/uw522-s12/lec1.pdf
$endgroup$
I cannot quickly scan the whole text to check all references to 7.8. Based on the contents of chapter Uniform convergence and continuity (pages 149-151), Theorem 7.8 is used to prove Theorem 7.15, which is essentially about complex-valued, bounded and continuous functions $mathcal{C}(X)$.
Theorem 3.11 is about metric spaces that are either compact, $mathcal{R}^n$ or $mathcal{C}$.
So $E$ in Theorem 7.8 is a typo. Actually, it should be $mathcal{C}$ as we are dealing with complex-valued functions.
Yes, this book had 3 editions, so many views, but no mention of this bit in errata.
Errata from George Bergman does not include this error https://math.berkeley.edu/~gbergman/ug.hndts/m104_Rudin_notes.pdf
Notes from Jiří Lebl point to complex-valued functions for Theorem 7.8, page 3 of 21 in PDF
https://math.okstate.edu/people/lebl/uw522-s12/lec1.pdf
edited May 20 '17 at 16:47
answered May 20 '17 at 13:15
Mikhail DMikhail D
34325
34325
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2074779%2fdo-we-assume-f-ns-map-into-bbbr-or-bbbc-in-theorem-7-8-rudins-pri%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Is one conclusion true and the other false?
$endgroup$
– Robert Wolfe
Dec 6 '18 at 14:12