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

问题在问什么

Previous set of notes: Notes 1 . Next set of notes: Notes 3 .

We now leave the topic of Riemann surfaces, and turn now to the (loosely related) topic of conformal mapping (and quasiconformal mapping ). Recall that a conformal map from an open subset of the complex plane to another open set is a map that is holomorphic and bijective, which (by Rouché’s theorem) also forces the derivative of to be nowhere vanishing. We then say that the two open sets are conformally equivalent. From the Cauchy-Riemann equations we see that conformal maps

已知结果和反例

In previous quarters, we proved a fundamental theorem about this concept, the Riemann mapping theorem :

Theorem 1 (Riemann mapping theorem) Let be a simply connected open subset of that is not all of . Then is conformally equivalent to the unit disk .

证明或构造的主线

This theorem was proven in these 246A lecture notes , using an argument of Koebe. At a very high level, one can sketch Koebe’s proof of the Riemann mapping theorem as follows: among all the injective holomorphic maps from to that map some fixed point to , pick one that maximises the magnitude of the derivative (ignoring for this discussion the issue of proving that a maximiser exists). If avoids some point in , one can compose with various holomorphic maps and use Schwarz’s l

It is a beautiful observation of Thurston that the concept of a conformal mapping has a discrete counterpart, namely the mapping of one circle packing to another. Furthermore, one can run a version of Koebe’s argument (using now a discrete version of Perron’s method ) to prove the Riemann mapping theorem through circle packings. In principle, this leads to a mostly elementary approach to conformal geometry, based on extremely classical mathematics that goes all the way back t

阅读时建议盯住的点

To make the above discussion more precise we need some notation.

Definition 2 (Circle packing) A (finite) circle packing is a finite collection of circles in the complex numbers indexed by some finite set , whose interiors are all disjoint (but which are allowed to be tangent to each other), and whose union is connected. The nerve of a circle packing is the finite graph whose vertices are the centres of the circle packing, with two such centres connected by an edge if the circles are tangent. (In these notes all graphs are undirected, fini

值得单独记下的条目

• (i) is a maximal planar graph.
• (iii) Every drawing of divides the plane into faces that have three edges each, and each edge is adjacent to two distinct faces. (This includes one unbounded face.)
• (iv) At least one drawing of divides the plane into faces that have three edges each, and each edge is adjacent to two distinct faces.
• (ii) The graph is connected and non-empty, and every vertex in is adjacent to at least one vertex in .
• (i) Show that the Poincaré distance is invariant with respect to Möbius automorphisms of , thus whenever is a transformation of the form (1) . Similarly show that the hyperbolic area is invariant with respect to such transformations.
• (iv) If two circles in are externally tangent, show that the geodesic connecting the hyperbolic centers passes through the point of tangency, orthogonally to the two tangent circles.
• (iii) Show that the area of the interior of a hyperbolic circle with is equal to .
• (i) (Local constraint) The angles of all the hyperbolic triangles around any given interior vertex must sum to exactly . (In particular, this forces to be finite, since otherwise all the angles here would vanish.)

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

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

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

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

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