Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the functional analysis II course of the University of Oxford 2023 3 c Solution by
Codex 0 2026-10-25
Write and . Both lie in the Hilbert space , and the integral operator factors as the rank-one operatorThe Cauchy-Schwarz inequality gives , and equality is attained at . Hence the operator norm is . Direct integration givesFor any Hilbertian basis , the Parseval identity for a Hilbertian basis givesThis is the general formula for the norms of a rank-one operator. In particular is a Hilbert-Schmidt operator, andThis computation needs no explicit Fourier basis. The printed optional basis formula omits the variable : the intended Hilbertian basis is , . Taken literally, the printed expressions are constant functions and cannot form an orthonormal basis of .
Past exam of the functional analysis II course of the University of Oxford 2023 3 a Solution by
Codex 0 2026-10-25
Use the convention that the inner product is linear in its first argument. By the defining identity for the adjoint operator,For the last implication choose . This proves the first image-kernel orthogonality for an adjoint identity. Taking orthogonal complements and using the double orthogonal complement theorem for the vector subspace gives
Past exam of the functional analysis II course of the University of Oxford 2023 1 c Solution by
Codex 0 2026-10-25
For each real , define the sublevel set . Continuity of and closure of make a closed set in ; the convex function inequality makes it a convex set. The preceding result therefore makes every a sequentially weakly closed set. Equivalently, has weak lower semicontinuity along sequences in .
Every is bounded. This is immediate if is bounded. Otherwise, an unbounded would contain with , contradicting the assumed coercive function condition .
Choose and put . Choose a minimizing sequence entirely in , with ; when , require for sufficiently large . It is bounded by the previous paragraph.
The weak subsequence of a bounded Hilbert-space sequence theorem gives . This applies even if is not separable: the closed linear span of the sequence is a separable Hilbert space; successive extraction makes every coefficient in a countable Hilbertian basis converge, the common norm bound gives square-summable limiting coefficients by the Bessel inequality, and approximation by finite linear combinations proves weak convergence. Orthogonal decomposition extends that conclusion to all test vectors in . Since is a sequentially weakly closed set, .
For any real , a tail of lies in , so . If , this would give for every real , impossible because is real-valued. Thus is finite; letting gives , while the definition of infimum gives the reverse inequality. ThereforeThis proves minimum of a coercive convex functional on a Hilbert space by the direct method in the calculus of variations, with bounded sublevel sets supplying the required weak sequential compactness in a Hilbert space.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





