在最小先验假设下推导一个变分原理
Deducing a variational principle with minimal a priori assumptions
摘要:
研究了图同态从$\mathbb{Z}^m$到$\mathbb{Z}$的变分原理和大偏差原理。我们提供了一个强大的方法来推导这些原则下最小的先验假设。唯一的成分具体的模型是一个离散Kirszbraun定理,即扩展定理的图同态。所有其他成分都是一般性的,而不是特定于模型。它们包括小学组合学、Lipschitz函数的紧性和单纯Rademacher定理。与文献相比,我们的证明不需要任何其他的初步结果,如浓度或严格的局部表面张力凸性。因此,该方法是非常鲁棒的,并扩展到更复杂和微妙的模型,例如,均匀化的限制形状或图形同态到一个规则的树。
英文摘要:
We study the well-known variational and large deviation principle for graph homomorphisms from $\mathbb{Z}^m$ to $\mathbb{Z}$. We provide a robust method to deduce those principles under minimal a priori assumptions. The only ingredient specific to the model is a discrete Kirszbraun theorem i.e. an extension theorem for graph homomorphisms. All other ingredients are of a general nature not specific to the model. They include elementary combinatorics, the compactness of Lipschitz functions and a simplicial Rademacher theorem. Compared to the literature, our proof does not need any other preliminary results like e.g. concentration or strict convexity of the local surface tension. Therefore, the method is very robust and extends to more complex and subtle models, as e.g. the homogenization of limit shapes or graph-homomorphisms to a regular tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。