$L_0$二元性的简明证明
A Concise Proof of the $L_0$ Dichotomy
AI总结：
本文基于Bernshteyn提出的图论框架，通过σ-理想和奇走条件，给出$L_0$二元性更简短的证明，利用反射定理替代原超限构造。
摘要：
Carroy, Miller, Schrittesser和Vidnyánszky建立了$L_0$二元性：存在一个Borel图，其Borel色数为三，可连续同态到每个Borel色数至少为三的解析图。他们的证明依赖于对终端近似进行超限分析的递减$ω_1$序列解析集。本文给出该结果的新证明，通过适应Bernshteyn最近为$G_0$二元性引入的图论框架。核心工具是一个σ-理想，其中包含从有限路径近似到目标图的同态集，其中小性由顶点投影上的有界奇走条件证明。关键引理是大性在倍增操作下得以保持，通过第一反射定理建立，取代原超限构造为单个Borel反射论证。连续同态从标准图$\mathbb{L}_c$到目标图则通过缩小家族的副本极限获得，与Bernshteyn为$G_0$证明的方法直接类比。
英文摘要：
Carroy, Miller, Schrittesser, and Vidnyánszky established the $L_0$ dichotomy: there is a Borel graph of Borel chromatic number three that admits a continuous homomorphism to every analytic graph of Borel chromatic number at least three. Their proof relies on a transfinite analysis of terminal approximations over a decreasing $ω_1$-sequence of analytic sets. I give a new, substantially shorter proof of this result by adapting the graph-theoretic framework recently introduced by Bernshteyn for the $G_0$ dichotomy. The central device is a $σ$-ideal of \emph{small} sets of homomorphisms from finite path approximations into the target graph, where smallness is witnessed by a bounded odd-walk condition on vertex projections. The key lemma that largeness is preserved under the doubling operation is established via the First Reflection Theorem, replacing the original transfinite construction with a single Borel reflection argument. The continuous homomorphism from the canonical graph $\mathbb{L}_c$ into the target is then obtained as a limit of shrinking families of copies, in direct analogy with Bernshteyn's proof for $G_0$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
