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

问题在问什么

Let denote the space of matrices with integer entries, and let be the group of invertible matrices with integer entries. The Smith normal form takes an arbitrary matrix and factorises it as , where , , and is a rectangular diagonal matrix, by which we mean that the principal minor is diagonal, with all other entries zero. Furthermore the diagonal entries of are for some (which is also the rank of ) with the numbers (known as the invariant factors ) principal divisors with . T

在这类讨论里 I would like to record how to use the Smith normal form to computationally manipulate two closely related classes of objects:

已知结果和反例

The above two classes of objects are isomorphic to each other by Pontryagin duality: if is a lattice subgroup, then the orthogonal complement

Let us focus first on lattice subgroups . As all such subgroups are finitely generated abelian groups, one way to describe a lattice subgroup is to specify a set of generators of . Equivalently, we have

证明或构造的主线

By the above discussion we can represent a lattice subgroup by a matrix for some ; this representation is not unique, but 下面会 address this issue shortly. For now, we focus on the question of how to use such data representations of subgroups to perform basic operations on lattice subgroups. There are some operations that are very easy to perform using this data representation:

One can also use Smith normal form to detect when one lattice subgroup is a subgroup of another lattice subgroup . Using Smith normal form factorization , with invariant factors , the relation is equivalent after some manipulation to

阅读时建议盯住的点

One can now test whether by testing whether and simultaneously hold (there may be more efficient ways to do this, but this is already computationally manageable in many applications). This in principle addresses the issue of non-uniqueness of representation of a subgroup in the form .

Next, we consider the question of representing the intersection of two subgroups in the form for some and . We can write

值得单独记下的条目

• Subgroups of a standard lattice (or lattice subgroups for short);
• Closed subgroups of a standard torus (or closed torus subgroups for short).
• (Applying a linear transformation) if , so that is also a linear transformation from to , then maps lattice subgroups to lattice subgroups, and clearly maps the lattice subgroup to for any .
• (Sum) Given two lattice subgroups for some , , the sum is equal to the lattice subgroup , where is the matrix formed by concatenating the columns of with the columns of .
• (Direct sum) Given two lattice subgroups , , the direct sum is equal to the lattice subgroup , where is the block matrix formed by taking the direct sum of and .
• To determine whether one closed torus subgroup is contained in (or equal to) another closed torus subgroup , simply use the preceding methods to check whether the lattice subgroup is contained in (or equal to) the lattice subgroup .
• To compute the pull back of a closed torus subgroup via a linear transformation , use the identity Similarly, to compute the image of a closed torus subgroup , use the identity

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

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

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

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

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