Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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 Cohen reals form a symmetric set but their enumeration is not symmetric

Statement

The coordinate action is πa˙n=a˙πn. Each an has support {n}, A has empty support, and A is forced infinite with distinct members. The canonical enumeration nan has no finite support, and no enumeration of A belongs to the symmetric model.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

The basic Cohen symmetric system gives πa˙n=a˙πn and πA˙=A˙.

[F2]

Symmetry lemma for forcing automorphisms transports forced assertions.

Proof

1.1

F1 shows that {n} supports a˙n and supports A˙; their subnames are checks, so both are HS. For nm, below any condition choose a fresh bit coordinate k and set opposite bits at (n,k),(m,k). Hence the set forcing a˙na˙m is dense. Every finite collection is therefore forced to have its displayed size, so A is infinite.

F1
1.2

Let e˙ be the canonical graph na˙n. Given finite E, choose nE and mE{n}. Their transposition fixes E but sends the graph value at n from a˙n to a˙m, so it does not fix e˙. Thus no finite E supports that name.

F1F2
1.3

Now let pf˙:ωˇA˙ be onto and let the finite set E support f˙ and contain the first-coordinate support of p. Choose nE. Since p forces surjectivity, some qp and kω satisfy qf˙(kˇ)=a˙n. Choose m outside E{n} and outside the first-coordinate support of q, and let π swap n,m. Then πp=p, πf˙=f˙, and F2 gives

πqf˙(kˇ)=a˙m.
2.1

Because the m-coordinate is absent from q, q and πq agree on their common domain and have a common extension. That extension forces a˙n=a˙m, contrary to step 1.1. Therefore no HS name can enumerate A.

F1F2step 1.1step 1.3

Depends on

Used by

Dependency tree · two levels

9 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