arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2210.02201math.FAmath.CA
收藏

测度论中的完备化程序

Completion procedures in measure theory

A. G. Smirnov, M. S. Smirnov

AI总结:

本文提出基于完备化环的统一框架,通过添加零集扩展群值容度,涵盖已知完备化程序并产生新扩展,给出保持σ-可加性条件及测度判据。

摘要:

我们提出了一种统一处理群值容度(即定义在环上的加性集函数)扩展的方法,该方法通过添加新的零集来实现。我们的方法基于容度 $\mu$ 的完备化环的概念。对于每个这样的环 $\mathcal N$,自然关联着一个 $\mu$ 的扩展,称为 $\mu$ 的 $\mathcal N$-完备化。$\mathcal N$-完备化操作涵盖了大多数先前已知的完备化型程序,并产生了一些新的扩展,这些扩展可能有助于在测度论中构造反例。我们找到了一个条件,确保容度的 $\sigma$-可加性在 $\mathcal N$-完备化下得以保持,并建立了 $\mathcal N$-完备化后的测度再次成为测度的判据。

英文摘要:

We propose a unified treatment of extensions of group-valued contents (i.e., additive set functions defined on a ring) by means of adding new null sets. Our approach is based on the notion of a completion ring for a content $μ$. With every such ring $\mathcal N$, an extension of $μ$ is naturally associated which is called the $\mathcal N$-completion of $μ$. The $\mathcal N$-completion operation comprises most previously known completion-type procedures and also gives rise to some new extensions, which may be useful for constructing counterexamples in measure theory. We find a condition ensuring that $σ$-additivity of a content is preserved under the $\mathcal N$-completion and establish a criterion for the $\mathcal N$-completion of a measure to be again a measure.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑