什么是光滑性？
What is Smoothness?
浏览论文内容
中文总结 AI 辅助
该研究针对群上函数的光滑性定义问题，通过Cayley图拉普拉斯算子的特征值均值排序构造了不可约表示的排序函数，明确光滑性依赖于群与生成集的选择。
中文摘要 AI 辅助
实直线上函数的光滑性体现在其傅里叶变换的衰减特性，这表明群G的L²(G)空间中函数的光滑性应意味着其傅里叶系数集中在低频区域。这种解读预设了G的不可约表示的排序，但对于非阿贝尔群G，不存在规范的排序。给定对称生成集S，相关Cayley图的拉普拉斯算子在对偶空间上是块对角的，我们通过每个块内特征值的均值对不可约表示（irrep）进行排序，由此得到仅依赖于对(G,S)的排序函数ω:Ĝ→ℝ。该函数的取值范围在0到2之间，仅在平凡表示处为0，且当且仅当Cayley图是二分图时达到上界。我们接着探究该构造的自由度：在满足自然公理的算子类中，诱导出的排序恰好是对偶空间上在平凡表示处消失且在共轭对上一致的实函数，而来自共轭类逆轨道的排序构成了这类函数的基。我们通过添加两个额外输入进一步限制自由度：类权重的非负性，以及对哪些群元素属于均匀增量变化的声明，这将算子确定为Cayley拉普拉斯算子（仅差一个正尺度因子）。我们发现，即使不存在Cayley图，该构造对紧群依然成立，并将理论扩展到具有传递群作用的有限集合，其中作用群选择存在的频率，生成集对这些频率排序。因此，标题问题的答案是：光滑性是函数与群及生成集选择共同决定的性质，而非仅属于函数本身。
英文摘要
Smoothness of a function on the real line is reflected in the decay of its Fourier transform, which suggests that smoothness of a function in $L^2(G)$ for a group $G$ should mean concentration of the Fourier coefficients at low frequency. Such a reading presupposes an ordering of the irreducible representations of $G$, but for non-abelian $G$, no ordering is canonical. Given a symmetric generating set $S$, the Laplacian of the associated Cayley graph is block diagonal over the dual, and we order the irreps by the mean of the eigenvalues in each block. This produces an ordering function $ω:\widehat{G}\to\mathbb{R}$ that depends only on the pair $(G,S)$. This function is bounded between zero and two, vanishing only at the trivial representation and achieving the upper bound exactly when the Cayley graph is bipartite. We then ask how much freedom the construction has. Within the class of operators satisfying natural axioms, the induced orderings are exactly the real functions on the dual vanishing at the trivial representation and agreeing on conjugate pairs, and the orderings coming from inversion orbits of conjugacy classes form a basis for them. We cut the freedom down further by requiring two additional inputs: nonnegativity of the class weights and a declaration of which group elements count as uniform incremental changes, which pins the operator to the Cayley-Laplacian up to positive scale. We observe that the construction persists for compact groups even though the Cayley graph does not, and we extend the theory to finite sets carrying a transitive group action, where the acting group selects which frequencies exist and the generating set orders them. The answer to the title question is therefore that smoothness is a property of a function together with a choice of group and generating set, not of the function alone.
发表机构
- QodeX Quantum（科德克斯量子公司）
机构由 AI 辅助整理，请以论文原文为准。
