Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 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 Solovay model has no Hamel basis and no discontinuous additive real function

Statement

In M, R has no Hamel basis over Q, and every additive f:RR is continuous and R-linear.

Facts & Assumptions

Given: Universal real measurability in M.

[F1]

Every set of reals in the Solovay model is Lebesgue measurable: every subset of the real line occurring below is measurable in M.

[F3]

A Lebesgue measurable subgroup of (Rn,+) of positive measure is all of Rn: assuming Countable Choice, a measurable positive-measure subgroup of R is all of R.

[F6]

The Solovay inner model satisfies Dependent Choice and AC implies DC implies countable choice: M satisfies Dependent Choice, and ZF proves that Dependent Choice implies Countable Choice.

Proof

1.1

Suppose H is a Hamel basis. It is nonempty because it spans 1; choose one bH (one existential choice, not AC). Define cb(x) as the unique rational coefficient of b in the finite expansion of x. Then cb is additive, and F1 makes W=kercb a measurable proper subgroup. Moreover, R=qQ(qb+W). By F6, Countable Choice holds in M. If λ(W)>0, F3 gives W=R; if λ(W)=0, translation invariance in F4 makes every qb+W measurable and null, and countable subadditivity makes their explicitly rational-indexed union null. Monotonicity then gives λ([0,1])=0, contradicting the value 1 from F4.

F1F2F3F4F6
1.2

Let f be additive and put En={x[1,1]:f(x)n}. F1 makes these sets measurable, and they cover [1,1]. By F6, Countable Choice holds in M. If each were null, F4 would make their explicitly indexed union null, contrary to λ([1,1])=2; hence some En has positive measure. Steinhaus gives an interval about zero in EnEn, where additivity bounds f by 2n. F5 then yields continuity and f(x)=xf(1) for every real x. The zero map and n=0 cause no exception.

F1F4F5F6
2.1

Step 1.1 excludes a basis, and step 1.2 excludes every discontinuous additive solution, without invoking an AC basis-existence theorem.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

108 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