Oracle-树强制与十三元素情形下的Wilfs不等式
Oracle-Tree Forcing and Wilfs Inequality for Thirteen Left Elements
浏览论文内容
中文总结 AI 辅助
本文研究filter-Laver强制及其商与基数性质，证明网格贫乏理想覆盖数与贫乏理想一致，并应用该框架给出十三元素数值半群的Wilfs不等式c≤13e的完整算术证明。
中文摘要 AI 辅助
我们研究在ω×ω上的filter-Laver强制，其后继集合包含最终象限。保持最小坐标和方向的观察是一个完全投影。其有限非平凡隐藏标签商是Cohen强制，而完全偏移商具有等于基础模型支配数dV的布尔密度。对于相关的网格贫乏理想I_box，我们证明cov(I_box)=add(M)（其中M为通常的贫乏理想），并获得进一步的基数界。我们还分析了阈值博弈、Oracle度以及正证书集与filter-大证书集之间的区别：递归filter-大接受允许其每个分支都成功的细化。作为算术应用，我们证明了Wilfs不等式c≤13e，其中c为导子，e为嵌入维数，适用于具有十三个元素的数值半群。附录中给出了完整的算术证明，包括有界精确计算。其终止证书程序为每个强制条件提供可计算的象限树和一致细化。有限支持核描述了已注册证明的持久性；算术绝对性精确解释了强制如何组织这些证书而不替换其算术论证。
英文摘要
We study filter-Laver forcing on omegaxomega with successor sets containing final quadrants. The observation retaining the minimum coordinate and orientation is a complete projection. Its finite nontrivial hidden-label quotients are Cohen, whereas the full offset quotient has Boolean density equal to the ground-model dominating number dV . For the associated grid-meager ideal I_box, we prove cov(I_box) = add(M) for the usual meager ideal M, and obtain further cardinal bounds. We also analyze threshold games, oracle degrees and the distinction between positive and filter-large certificate sets: recurrent filter-large acceptance admits refinements whose every branch succeeds. As an arithmetic application, we prove Wilfs inequality c \leq 13e for numerical semigroups with thirteen elements below the conductor c, where eis the embedding dimension. A complete arithmetic proof, including a bounded exact computation, is given in the appendix. Its terminating certificate procedures supply a computable quadrant tree and uniform refinements for every forcing condition. Finite support kernels describe persistence of the registered proofs; arithmetic absoluteness explains precisely why forcing organizes these certificates without replacing their arithmetic justification.
