Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Cross-ideal and bounding inequalities in Cichoń's diagram

Statement

In ZFC, cov⁡(N)≤non⁡(M),cov⁡(M)≤non⁡(N), add⁡(M)≤b≤non⁡(M),cov⁡(M)≤d≤cof⁡(M).

Facts & Assumptions

Given: The null and meagre ideals on R, the eventual domination numbers b,d, and ZFC.

[F1]

The four ideal invariants have their usual witness minima, and b is the least size of an unbounded family in (ωω,≤∗), while d is the least size of a dominating family. (Add, cov, non and cof for null and meagre ideals, Eventual domination and the numbers b and d)

[F4]

AC permits selecting witness families of the attained cardinal minima and selecting one coded meagre cover for each member of a basis. (The Axiom of Choice)

Proof

technique · translation, Baire-space bounds, and a chopped-cylinder witness
1.1

Enumerate the rationals as (qi)i. For each n, choose open intervals around qi whose total length is <2−n, and let On be their union. Each On is dense open and has measure <2−n, so B=⋂nOn is dense Gδ and null. Its complement C=⋃n(R∖On) is meagre. Every translate of B is null and comeagre; every translate of C is meagre and conull.

F3
1.2

For g∈ωω put Bg={x∈ωω:x≤∗g}. It is meagre: it is the union over m of the closed nowhere-dense sets ⋂n≥m{x:x(n)≤g(n)}. A family of size below b is bounded by some g, so its image in Baire space is meagre. By [F2], a nonmeagre subset of R has a nonmeagre intersection with the irrationals, since the rationals are countable meagre. Consequently b≤non⁡(M). A dominating family D of size d gives the meagre cover (Bg)g∈D of Baire space; transport it to the irrationals and add the rational set to one cover member. Each transported member is meagre in R, because the irrationals are a dense Gδ subspace with countable complement. Hence cov⁡(M)≤d.

F1F2F4
1.3

In Cantor space, for each n list every clopen interval cylinder Smn={x:x↾[n,k)=s},k>n,s∈2[n,k). For any dense open D, some listed Smn lies in D: successively extend a common suffix while processing the finitely many length-n prefixes, so all their concatenations land in D. Every listed interval cylinder meets every length-n prefix cylinder. It follows that for any f∈ωω, each tail union ⋃n≥rSf(n)n is dense open, and Mf=2ω∖lim sup⁡nSf(n)n is meagre. This family is inclusion-cofinal: if A⊆⋃jFj with Fj closed nowhere dense, choose Sf(n)n inside the dense open complement of ⋃j≤nFj, making A⊆Mf.

F2
2.1

If X is nonmeagre and y∈R, then X cannot be contained in the meagre complement of y−B, so y=x+b for some x∈X,b∈B. Thus the null translates (x+B)x∈X cover R, giving cov⁡(N)≤∣X∣. Take ∣X∣=non⁡(M). Likewise, if X is nonnull, it meets the conull translate y−C for every y, so the meagre translates (x+C)x∈X cover R and give cov⁡(M)≤non⁡(N).

step 1.1F1F4
2.2

Let kf(n)>n be the right endpoint of Sf(n)n. For a strictly increasing g with g(n)>n, put Eg={x:for all sufficiently large n,some i∈[n,g(n)) has x(i)=1}. This is meagre: for every r, the union over n≥r of the zero-block cylinders {x:x↾[n,g(n))=0} is dense open, so its limsup is comeagre and its complement is Eg.

step 1.3
3.1

We claim Eg⊆Mf⇒g≤∗kf. If g(n)>kf(n) infinitely often, choose increasing nj from those indices with g(nj)<nj+1. Define x to agree with the prescribed pattern Sf(nj)nj on [nj,kf(nj)) and to equal 1 elsewhere. The blocks are disjoint, so x belongs to infinitely many Sf(nj)nj and hence x∉Mf. Yet x∈Eg: outside the prescribed blocks x(n)=1; when n lies inside the block starting at nj, monotonicity gives g(n)≥g(nj)>kf(nj), and the coordinate kf(nj) is outside all prescribed blocks and has value 1. Thus Eg⊈Mf, proving the claim.

step 2.2
4.1

Choose an unbounded family G of strictly increasing functions of size b; replacing an arbitrary witness by its strictly increasing running majorants preserves unboundedness. If ⋃g∈GEg were meagre, step 1.3 would put it in one Mf, and step 3.1 would make kf dominate every g∈G, a contradiction. Therefore add⁡(M2ω)≤b. If (Ai)i<cof⁡(M2ω) is an inclusion-cofinal meagre family, use [F4] to select fi with Ai⊆Mfi. Every Eg lies in some Ai, so step 3.1 says g≤∗kfi. The family (kfi)i dominates, whence d≤cof⁡(M2ω). Transfer these two inequalities to R by [F3]. AC is used exactly for the cardinal witness families and indexed choices of fi; the interval construction itself uses finite searches. ∎

step 1.3step 3.1F1F3F4

Depends on

Used by

Dependency tree · two levels

51 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources