An F-sigma ideal without web closure or uncountable strongly unbounded sets

We construct a proper F-sigma ideal on the countable grid for which web closure fails while every strongly unbounded subfamily is countable. This gives a negative answer to Conjecture 4.14 of Hernandez-Hernandez, Hrusak and Rivas-Gonzalez, The bounded topology. The preprint includes a complete elementary proof and a companion Lean 4 formalization. The general thinning bound is 4C and the row-finite bound is 3C. AI-assisted work under the author’s direction. OpenAI Codex assisted with exploration, formalization, auditing and drafting. Kernel verification is distinguished from independent peer review and historical-priority certification. A limited literature search did not identify an earlier resolution; no exhaustive priority claim is made. Files: English preprint PDF and LaTeX/Lean source archive with pinned dependencies and verification records.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-29
DOI
https://doi.org/10.5281/zenodo.23028923
Primary Topic
Commutative Algebra and Its Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

An F-sigma ideal without web closure or uncountable strongly unbounded sets

Haoxuan Ye
Zenodo (CERN European Organization for Nuclear Research)
Commutative Algebra and Its Applications
preprint

An F-sigma ideal without web closure or uncountable strongly unbounded sets

Haoxuan Ye
preprint en

Abstract

We construct a proper F-sigma ideal on the countable grid for which web closure fails while every strongly unbounded subfamily is countable. This gives a negative answer to Conjecture 4.14 of Hernandez-Hernandez, Hrusak and Rivas-Gonzalez, The bounded topology. The preprint includes a complete elementary proof and a companion Lean 4 formalization. The general thinning bound is 4C and the row-finite bound is 3C. AI-assisted work under the author’s direction. OpenAI Codex assisted with exploration, formalization, auditing and drafting. Kernel verification is distinguished from independent peer review and historical-priority certification. A limited literature search did not identify an earlier resolution; no exhaustive priority claim is made. Files: English preprint PDF and LaTeX/Lean source archive with pinned dependencies and verification records.

Zenodo (CERN European Organization for Nuclear Research)
Commutative Algebra and Its Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.