Lecture 17: Minimizers, Orthogonal Complements and the Riesz Representation Theorem

  Рет қаралды 5,434

MIT OpenCourseWare

MIT OpenCourseWare

Күн бұрын

Пікірлер: 8
@hausdorffm
@hausdorffm Жыл бұрын
At 6:57, both examples are same. I guess one of example should show that if we drop the convexity in the theorem, then the uniqueness no longer holds. In the first example, I guess what he want to show was that the minimizer is not unique, but the all points of the circle, so uniqueness does not holds when C is concave.
@akrishna1729
@akrishna1729 2 жыл бұрын
First of all, thank you so much for this clear and lucid presentation of the material. At 7:30, when Dr. Rodriguez illustrates the example of the complement of an open ball in R^2, he states that the set is neither closed nor convex -- I believe he meant to say that it is only non-convex (it would be closed by definition, as the complement of an open set in the usual metric topology) which would demonstrate the necessity of convexity; the minimum norm occurs across the boundary of the disk. If it were both closed and convex as a counterexample, we couldn't conclude that either property was necessary for the length-minimization property to hold. To show that being closed is also needed, we could also (in addition to Dr. Rodriguez's second example) take an open ball not centered at the origin: a unique minimum-norm element (some point closest to zero) would occur on its boundary, which the ball does not contain because that is its set of limit points.
@shivangsachar5144
@shivangsachar5144 Жыл бұрын
I don't understand why convexity is necessary. If you take the complement of the open ball, then the infimum is attained on the boundary, which is in the set (sure, it's not unique). Can you give an example of a convex set where the infimum is not attained anywhere?
@akrishna1729
@akrishna1729 Жыл бұрын
​@Shivang Sachar I believe this is to demonstrate failure of uniqueness specifically. I'm not sure if convexity is needed for existence, but I will try to come up with/search for a proof or a counterexample.
@arkarupbasumallik
@arkarupbasumallik Ай бұрын
​@@akrishna1729don't you need convexity to show that (u_{n}+u_{m}) /2 is in C for the proof of the existence part while establishing that the candidate sequence is Cauchy?
@jonystuck2030
@jonystuck2030 2 жыл бұрын
Great Lecture!
@ktayeb6774
@ktayeb6774 2 жыл бұрын
your inf is a minimum ,because it is attained
@SSNewberry
@SSNewberry 2 жыл бұрын
He is slow but packs a punch all the way to the end of the lecture.
Lecture 18: The Adjoint of a Bounded Linear Operator on a Hilbert Space
1:12:18
Necessity of complex numbers
7:39
MIT OpenCourseWare
Рет қаралды 2,8 МЛН
Beat Ronaldo, Win $1,000,000
22:45
MrBeast
Рет қаралды 78 МЛН
Кто круче, как думаешь?
00:44
МЯТНАЯ ФАНТА
Рет қаралды 6 МЛН
Functional Analysis 15 | Riesz Representation Theorem
10:10
The Bright Side of Mathematics
Рет қаралды 41 М.
Functional Analysis 15 | Riesz Representation Theorem [dark version]
9:56
The Bright Side of Mathematics
Рет қаралды 2,6 М.
20. Savings
1:14:29
MIT OpenCourseWare
Рет қаралды 1 МЛН
The Big Picture of Linear Algebra
15:57
MIT OpenCourseWare
Рет қаралды 986 М.
26. Chernobyl - How It Happened
54:24
MIT OpenCourseWare
Рет қаралды 2,9 МЛН
Class 01 Reading Marx's Capital Vol I with David Harvey
1:51:08
Reading Marx's Capital with David Harvey
Рет қаралды 1 МЛН
MIT Introduction to Deep Learning | 6.S191
1:09:58
Alexander Amini
Рет қаралды 754 М.
Daniel Everett, "Homo Erectus and the Invention of Human Language"
1:10:43
Harvard Science Book Talks and Research Lectures
Рет қаралды 529 М.
Linear functionals and adjoints part 1: Riesz representation, adjoint
24:44
The Langlands Program - Numberphile
1:03:27
Numberphile
Рет қаралды 454 М.