<p>Let (<i>X</i>,&#xa0;<i>G</i>), (<i>Y</i>,&#xa0;<i>G</i>) be two <i>G</i>-systems, where <i>G</i> is an infinite countable discrete amenable group and <i>X</i>, <i>Y</i> are compact metric spaces. Suppose that <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\({\mathcal {U}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">U</mi> </math></EquationSource> </InlineEquation> is a cover of <i>X</i>. We first introduce the conditional local topological intricacy <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\text {Int}_\text {top} (G,{\mathcal {U}}|Y)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mtext>Int</mtext> <mtext>top</mtext> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo>,</mo> <mi mathvariant="script">U</mi> <mo stretchy="false">|</mo> <mi>Y</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and average sample complexity <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\text {Asc}_\text {top} (G,{\mathcal {U}}|Y)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mtext>Asc</mtext> <mtext>top</mtext> </msub> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo>,</mo> <mi mathvariant="script">U</mi> <mo stretchy="false">|</mo> <mi>Y</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. Given an invariant measure <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\mu \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>μ</mi> </math></EquationSource> </InlineEquation> of <i>X</i>, we study the conditional local measure-theoretical intricacy <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\text {Int}_\mu ^\pm (G,{\mathcal {U}}|Y)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mtext>Int</mtext> <mi>μ</mi> <mo>±</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo>,</mo> <mi mathvariant="script">U</mi> <mo stretchy="false">|</mo> <mi>Y</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and average sample complexity <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\text {Asc}_\mu ^\pm (G,{\mathcal {U}}|Y)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mtext>Asc</mtext> <mi>μ</mi> <mo>±</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo>,</mo> <mi mathvariant="script">U</mi> <mo stretchy="false">|</mo> <mi>Y</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. For any Følner sequence <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\{F_n\}_{n\in \mathbb {N}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">{</mo> <msub> <mi>F</mi> <mi>n</mi> </msub> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>∈</mo> <mi mathvariant="double-struck">N</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>, we take <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\{c^{F_n}_S\}_{S\subseteq F_n}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">{</mo> <msubsup> <mi>c</mi> <mi>S</mi> <msub> <mi>F</mi> <mi>n</mi> </msub> </msubsup> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>S</mi> <mo>⊆</mo> <msub> <mi>F</mi> <mi>n</mi> </msub> </mrow> </msub> </math></EquationSource> </InlineEquation> to be the uniform system of coefficients. We establish the equivalence of <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\text {Asc}_\mu ^-(G,{\mathcal {U}}|Y)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mtext>Asc</mtext> <mi>μ</mi> <mo>-</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo>,</mo> <mi mathvariant="script">U</mi> <mo stretchy="false">|</mo> <mi>Y</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\text {Asc}_\mu ^+(G,{\mathcal {U}}|Y)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mtext>Asc</mtext> <mi>μ</mi> <mo>+</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo>,</mo> <mi mathvariant="script">U</mi> <mo stretchy="false">|</mo> <mi>Y</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> when <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(G=\mathbb {Z}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>=</mo> <mi mathvariant="double-struck">Z</mi> </mrow> </math></EquationSource> </InlineEquation>. Furthermore, we verified that <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\text {Asc}_\mu ^-(G,{\mathcal {U}})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mtext>Asc</mtext> <mi>μ</mi> <mo>-</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo>,</mo> <mi mathvariant="script">U</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is equal to <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(\text {Asc}_\mu ^+(G,{\mathcal {U}})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mtext>Asc</mtext> <mi>μ</mi> <mo>+</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo>,</mo> <mi mathvariant="script">U</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> in general case. Finally, we give a local variational principle of average sample complexity.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Local Intricacy and Average Sample Complexity for Amenable Group Actions

  • Jinna Huang,
  • Zubiao Xiao

摘要

Let (XG), (YG) be two G-systems, where G is an infinite countable discrete amenable group and X, Y are compact metric spaces. Suppose that \({\mathcal {U}}\) U is a cover of X. We first introduce the conditional local topological intricacy \(\text {Int}_\text {top} (G,{\mathcal {U}}|Y)\) Int top ( G , U | Y ) and average sample complexity \(\text {Asc}_\text {top} (G,{\mathcal {U}}|Y)\) Asc top ( G , U | Y ) . Given an invariant measure \(\mu \) μ of X, we study the conditional local measure-theoretical intricacy \(\text {Int}_\mu ^\pm (G,{\mathcal {U}}|Y)\) Int μ ± ( G , U | Y ) and average sample complexity \(\text {Asc}_\mu ^\pm (G,{\mathcal {U}}|Y)\) Asc μ ± ( G , U | Y ) . For any Følner sequence \(\{F_n\}_{n\in \mathbb {N}}\) { F n } n N , we take \(\{c^{F_n}_S\}_{S\subseteq F_n}\) { c S F n } S F n to be the uniform system of coefficients. We establish the equivalence of \(\text {Asc}_\mu ^-(G,{\mathcal {U}}|Y)\) Asc μ - ( G , U | Y ) and \(\text {Asc}_\mu ^+(G,{\mathcal {U}}|Y)\) Asc μ + ( G , U | Y ) when \(G=\mathbb {Z}\) G = Z . Furthermore, we verified that \(\text {Asc}_\mu ^-(G,{\mathcal {U}})\) Asc μ - ( G , U ) is equal to \(\text {Asc}_\mu ^+(G,{\mathcal {U}})\) Asc μ + ( G , U ) in general case. Finally, we give a local variational principle of average sample complexity.