Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

The Feferman–Levy symmetric collapse system

Definition

Work over a transitive ground model VZFC+GCH. The use of Choice is confined to the ground-model aleph sequence and the GCH cardinal calculations below; The Axiom of Choice is not assumed in the eventual symmetric model. Put κn=nV for n<ω and let P be the set of finite partial functions

p:ω×ωn<ωκn

such that p(n,i)<κn whenever (n,i)dom(p), ordered by reverse inclusion. Equivalently, p is a finite set of triples (n,i,α), functional in (n,i), with α<κn. Its restriction to the first m layers is

pm={(n,i,α)p:n<m}.

Thus the nth layer is the collapse order Col(ω,κn) from Cohen, collapse, and Lévy-collapse forcing orders, and P is their finite-support product.

Let G consist of the permutations π of ω×ω which preserve the first coordinate. Thus π(n,i)=(n,πn(i)) for a sequence of permutations πnSym(ω). It acts on P by

πp={(n,πn(i),α):(n,i,α)p},

and on names by Automorphisms acting on forcing names. For m<ω let

Hm={πG:πn=idω for every n<m}.

The subgroups Hm are normal, Hm+1Hm, and their upward closure is a normal filter F of subgroups. Hence (P,G,F) is a symmetric system in the sense of Symmetric forcing systems, supports, and hereditarily symmetric names. If G is V-generic, its hereditarily symmetric interpretation

N=HSFG

is called the Feferman–Levy model. A name is said to have m-bounded layer support when Hm fixes it.

Depends on

Used by

Dependency tree · two levels

12 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