跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.18541 · v1

No free lattice contains an infinite ascending chain of copies of FL(3)

首次提交 2026-11-14 02:49
版本更新 2026-11-14 02:49
雷达观测 2026-11-16 13:44
arXiv ↗PDF ↗

摘要

No free lattice contains an infinite strictly ascending chain of sublattices isomorphic to FL(3), the free lattice on three generators; this answers a question that R. A. Dean asked and the second author's 1997 notes on the problem left open. Every such chain would yield, inside FL(3), a coherent chain of proper self-embeddings Θ0,Θ1,Θ2,…Θ_0, Θ_1, Θ_2, \dots with Θk∘Θj=ΘjΘ_k \circ Θ_j = Θ_j for j<kj < k, so that each later embedding fixes the image of each earlier one pointwise. Every proper self-embedding of FL(3) whose fixed sublattice contains a free generating triple fixes one of the three generators, say zz, because a power of it or of its dual lies above the identity, and a self-embedding that moves every generator and lies above the identity fixes at most eleven elements. Up to duality, a proper self-embedding fixing the image of such a Θ1Θ_1 pointwise fixes only elements above z∧(x∨y)z \wedge (x \vee y), where no free generating triple containing zz can lie. We also verify the one-step example of the 1997 notes, prove that no step toward such a chain is self-similar, and show that the configuration the argument rules out at length three does occur at length two. Without freeness the answer reverses: FL(3) contains an infinite strictly ascending chain of 3-generated sublattices, so the lattice analogue of Takahasi's chain condition for free groups fails. The theorem itself is checked by the Agda proof assistant under its safe flags, for free lattices over generators with decidable equality, and its formal proof uses no classical principle: finite searches and an induction on a finite set replace the infinite pigeonhole principle by which a chain yields a coherent chain.

作者备注:59 pages, 13 figures; the main theorem is checked in Agda; the formal development is available at https://github.com/ualib/agda-deans-problem

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-14 02:49 · 最新观测版本

No free lattice contains an infinite ascending chain of copies of FL(3)

No free lattice contains an infinite strictly ascending chain of sublattices isomorphic to FL(3), the free lattice on three generators; this answers a question that R. A. Dean asked and the second author's 1997 notes on the problem left open. Every such chain would yield, inside FL(3), a coherent chain of proper self-embeddings Θ0,Θ1,Θ2,…Θ_0, Θ_1, Θ_2, \dots with Θk∘Θj=ΘjΘ_k \circ Θ_j = Θ_j for j<kj < k, so that each later embedding fixes the image of each earlier one pointwise. Every proper self-embedding of FL(3) whose fixed sublattice contains a free generating triple fixes one of the three generators, say zz, because a power of it or of its dual lies above the identity, and a self-embedding that moves every generator and lies above the identity fixes at most eleven elements. Up to duality, a proper self-embedding fixing the image of such a Θ1Θ_1 pointwise fixes only elements above z∧(x∨y)z \wedge (x \vee y), where no free generating triple containing zz can lie. We also verify the one-step example of the 1997 notes, prove that no step toward such a chain is self-similar, and show that the configuration the argument rules out at length three does occur at length two. Without freeness the answer reverses: FL(3) contains an infinite strictly ascending chain of 3-generated sublattices, so the lattice analogue of Takahasi's chain condition for free groups fails. The theorem itself is checked by the Agda proof assistant under its safe flags, for free lattices over generators with decidable equality, and its formal proof uses no classical principle: finite searches and an induction on a finite set replace the infinite pigeonhole principle by which a chain yields a coherent chain.

查看此版本解读 →查看此版本原文 ↗