Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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.

Assuming choice on the cosets of Q in R, a Vitali set in [0,1] exists

Statement

Assume the Axiom of Choice. Then there exists a Vitali set V⊆[0,1] in the sense of Vitali set on [0,1].

Facts & Assumptions

Given: The Axiom of Choice.

[F1]

A Vitali set on [0,1] is a subset meeting every equivalence class of x∼y  ⟺  x−y∈Q in exactly one point (Vitali set on [0,1]).

[A1]

Every family of nonempty sets has a choice function (The Axiom of Choice).

[F2]

A choice function for a family F is a function g with domain F such that g(S)∈S for every S∈F (Choice function).

Proof

technique · direct
1.1F1construct

Let F be the family of all sets of the form (x+Q)∩[0,1] with x∈[0,1]. Each member of F is nonempty because it contains its defining point, and distinct members are exactly the equivalence classes of the relation in [F1].

2.1step 1.1A1F2construct

By [A1] and [F2] there is a choice function g on F. Put V:={ g(S):S∈F }⊆[0,1]. Then V meets every member of F, and it meets each of them in exactly one point because g assigns one value to each set in its domain.

3.1step 1.1step 2.1F1∎

Since the members of F are exactly the equivalence classes of x∼y  ⟺  x−y∈Q on [0,1], step 2.1 says precisely that V is a Vitali set on [0,1].

Remarks

  • The proof uses one simultaneous selector on the family of Q-cosets meeting [0,1]. Nothing in the proof reduces that family to a countable one.

Depends on

Used by

Dependency tree · two levels

8 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