Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Normality is equivalent to positive pressing down

Statement

In ZFC, a proper tail-containing filter F on a regular uncountable κ is normal iff every regressive map on an F-positive Sκ{0} has an F-positive fibre. Such a normal filter is κ-complete.

Facts & Assumptions

[F1]

Normal filters on a regular cardinal: Normality is diagonal closure; positivity means meeting every filter member, and all tails belong to the proper filter.

[F2]

Regressive functions on ordinals: Regressive values are strictly below nonzero arguments.

Proof

Given: The objects and hypotheses in the statement.

1.1

If F is normal and every fibre of a regressive f:Sκ is small, all their complements belong to F. Their diagonal belongs to F and must meet S. At an intersection point α, its value f(α)<α forces it into the complement of its own fibre, a contradiction.

F1F2
1.2

Conversely let AξF and suppose their diagonal D is not in F. Then S=κD is positive and excludes zero. For αS, take the least ξ<α with αAξ. This defines a regressive map. A positive fibre would be disjoint from the corresponding filter member Aξ, impossible. Hence DF.

F1F2
2.1

For (Ai)i<μ in F, μ<κ, pad by κ at all remaining indices. Its diagonal, intersected with [μ,κ), is in F and is contained in i<μAi. Upward closure proves completeness. For μ=0 the intersection is κ.

F1step 1.2

Depends on

Used by

Dependency tree · two levels

4 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