<p>We work in the Baire space <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {Z}^\omega \)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="double-struck">Z</mi> </mrow> <mi>ω</mi> </msup> </math></EquationSource> </InlineEquation> equipped with the coordinate-wise addition <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq2.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="14" /> </InlineMediaObject> <EquationSource Format="TEX">\(+\)</EquationSource> <EquationSource Format="MATHML"><math> <mo>+</mo> </math></EquationSource> </InlineEquation>. Consider a <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq3.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="28" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sigma -\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>σ</mi> <mo>-</mo> </mrow> </math></EquationSource> </InlineEquation>ideal <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="14" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {I}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">I</mi> </math></EquationSource> </InlineEquation> and a family <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {T}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">T</mi> </math></EquationSource> </InlineEquation> of some kind of perfect trees. We are interested in results of the form: for every <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq6.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(A\in \mathcal {I}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>A</mi> <mo>∈</mo> <mi mathvariant="script">I</mi> </mrow> </math></EquationSource> </InlineEquation> and a tree <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq7.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(T\in \mathbb {T}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mo>∈</mo> <mi mathvariant="double-struck">T</mi> </mrow> </math></EquationSource> </InlineEquation> there exists <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq8.gif" Format="GIF" Height="18" Rendition="HTML" Resolution="72" Type="Linedraw" Width="108" /> </InlineMediaObject> <EquationSource Format="TEX">\(T'\in \mathbb {T}, T'\subseteq T\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>T</mi> <mo>′</mo> </msup> <mo>∈</mo> <mi mathvariant="double-struck">T</mi> <mo>,</mo> <msup> <mi>T</mi> <mo>′</mo> </msup> <mo>⊆</mo> <mi>T</mi> </mrow> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq9.gif" Format="GIF" Height="39" Rendition="HTML" Resolution="72" Type="Linedraw" Width="222" /> </InlineMediaObject> <EquationSource Format="TEX">\(A+\underbrace{[T']+[T']+\dots +[T']}_{\text {n--times}}\in \mathcal {I}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>A</mi> <mo>+</mo> <msub> <munder accentunder="true"> <mrow> <mrow> <mo stretchy="false">[</mo> <msup> <mi>T</mi> <mo>′</mo> </msup> <mo stretchy="false">]</mo> </mrow> <mo>+</mo> <mrow> <mo stretchy="false">[</mo> <msup> <mi>T</mi> <mo>′</mo> </msup> <mo stretchy="false">]</mo> </mrow> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <mrow> <mo stretchy="false">[</mo> <msup> <mi>T</mi> <mo>′</mo> </msup> <mo stretchy="false">]</mo> </mrow> </mrow> <mo>⏟</mo> </munder> <mtext>n--times</mtext> </msub> <mo>∈</mo> <mi mathvariant="script">I</mi> </mrow> </math></EquationSource> </InlineEquation> for each <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq10.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\in \omega \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>∈</mo> <mi>ω</mi> </mrow> </math></EquationSource> </InlineEquation>. Explored tree types include perfect trees, uniformly perfect trees, Miller trees, Laver trees and <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq11.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(\omega -\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ω</mi> <mo>-</mo> </mrow> </math></EquationSource> </InlineEquation>Silver trees. The latter kind of trees is an analogue of Silver trees from the Cantor space. Besides the standard <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq12.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sigma \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>σ</mi> </math></EquationSource> </InlineEquation>-ideal <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq13.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="25" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {M}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">M</mi> </math></EquationSource> </InlineEquation> of meager sets, we also analyze <InlineEquation ID="IEq14"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq14.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="33" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {M}_-\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="script">M</mi> <mo>-</mo> </msub> </math></EquationSource> </InlineEquation> and fake null sets <InlineEquation ID="IEq15"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="153_2025_966_Article_IEq15.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {N}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">N</mi> </math></EquationSource> </InlineEquation>. The latter two are born out of the characterizations of their respective analogues in the Cantor space. The key ingredient in proofs were combinatorial characterizations of these ideals in the Baire space.</p>

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

On algebraic sums, trees and ideals in the Baire space

  • Łukasz Mazurkiewicz,
  • Marcin Michalski,
  • Robert Rałowski,
  • Szymon Żeberski

摘要

We work in the Baire space \(\mathbb {Z}^\omega \) Z ω equipped with the coordinate-wise addition \(+\) + . Consider a \(\sigma -\) σ - ideal \(\mathcal {I}\) I and a family \(\mathbb {T}\) T of some kind of perfect trees. We are interested in results of the form: for every \(A\in \mathcal {I}\) A I and a tree \(T\in \mathbb {T}\) T T there exists \(T'\in \mathbb {T}, T'\subseteq T\) T T , T T such that \(A+\underbrace{[T']+[T']+\dots +[T']}_{\text {n--times}}\in \mathcal {I}\) A + [ T ] + [ T ] + + [ T ] n--times I for each \(n\in \omega \) n ω . Explored tree types include perfect trees, uniformly perfect trees, Miller trees, Laver trees and \(\omega -\) ω - Silver trees. The latter kind of trees is an analogue of Silver trees from the Cantor space. Besides the standard \(\sigma \) σ -ideal \(\mathcal {M}\) M of meager sets, we also analyze \(\mathcal {M}_-\) M - and fake null sets \(\mathcal {N}\) N . The latter two are born out of the characterizations of their respective analogues in the Cantor space. The key ingredient in proofs were combinatorial characterizations of these ideals in the Baire space.