陶哲轩博客写数学问题时，通常先把对象定义清楚，再给直觉、反例和证明轮廓。把「A proof of the Fredholm alternative」改写成可阅读的中文笔记，重点是：问题在问什么、已知到哪一步、下一步最容易走偏在哪。原站广告、分享条和导航已去掉。

问题在问什么

A few days ago, I found myself needing to use the Fredholm alternative in functional analysis:

Theorem 1 (Fredholm alternative) Let be a Banach space, let be a compact operator , and let be non-zero. Then exactly one of the following statements hold:

已知结果和反例

Among other things, the Fredholm alternative can be used to establish the spectral theorem for compact operators . A hypothesis such as compactness is necessary; the shift operator on , for instance, has no eigenfunctions, but is not invertible for any unit complex number . The claim is also false when ; consider for instance the multiplication operator on , which is compact and has no eigenvalue at zero, but is not invertible.

It had been a while since I had studied the spectral theory of compact operators, and I found that I could not immediately reconstruct a proof of the Fredholm alternative from first principles. So I set myself the exercise of doing so. 一个常见想法是 that I had managed to establish the alternative in all cases, but as pointed out in comments, my argument is restricted to the case where the compact operator is approximable , which means that it is the limit of finite rank operators i

证明或构造的主线

I also found out that this argument was essentially also discovered independently by by MacCluer-Hull and by Uuye . Nevertheless, I am recording this argument here , together with two more traditional proofs of the Fredholm alternative (based on the Riesz lemma and a continuity argument respectively).

In the finite-dimensional case, the Fredholm alternative is an immediate consequence of the rank-nullity theorem , and the finite rank case can be easily deduced from the finite dimensional case by some routine algebraic manipulation. The main difficulty in proving the alternative is to be able to take limits and deduce the approximable case from the finite rank case. The key idea of the proof is to use compactness to establish a lower bound on that is stable enough to allow

阅读时建议盯住的点

Fix a non-zero . It is clear that cannot have both an eigenvalue and bounded resolvent at , so now suppose that has no eigenvalue at , thus is injective. We claim that this implies a lower bound:

Lemma 2 (Lower bound) Let be non-zero, and suppose that be a compact operator that has no eigenvalue at . Then there exists such that for all .

值得单独记下的条目

• (Eigenvalue) There is a non-trivial solution to the equation .
• (Bounded resolvent) The operator has a bounded inverse on .
• (Finite multiplicity) is finite-dimensional.
• (Lower bound) There exists such that for all .
• (Closure) is a closed subspace of .
• (Finite comultiplicity) has finite codimension in .

阅读和落地时建议先做的 5 件事

1. 用自己的语言重写定义和结论，不看原文能不能说清对象是什么。
2. 找一个最小反例或边界情形，确认假设少一条会怎样。
3. 把证明拆成可独立检验的引理，每步只保留一个新想法。
4. 若涉及计算或形式化，先写可复现的小例子，再谈一般情形。
5. 记下尚未解决的缺口：缺估计、缺构造，还是缺正确的范畴。

和智能体、形式化工具怎么接

龙虾PRO做 OpenClaw 落地时，数学笔记最有用的部分往往是「可检验的步骤」：定义、反例、引理边界。智能体适合帮忙展开计算和检索，不适合代替你决定哪条假设能扔。

本文侧重全链路风控方法论。落地时请用自身业务单据做回放验证，不要把示例阈值直接当生产策略。 相关：风控体检 · 方案资源