Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)
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.

Chacon three cut one spacer towers

Definition

Work on [0,1) with the Lebesgue measurable sets and restricted set function introduced in Lebesgue measurable sets, the family L(Rn), and the restricted set function λn. Under the countable-choice consequence of The Axiom of Choice, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume makes this a complete measure space. The same assumption supplies the countable choice in A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included used for the actual interval measures below. The finite interval recursion itself is choice-free.

The stage-zero tower is the ordered list consisting of L0,0=[0,2/3); its reservoir is R0=[2/3,1). Suppose the stage-r list is (Lr,0,,Lr,hr1), with equal width wr. Cut each physical half-open interval Lr,j into its left, middle and right thirds Lr,j(0),Lr,j(1),Lr,j(2). The next ordered list is (Lr,0(0),,Lr,hr1(0),Lr,0(1),,Lr,hr1(1),Jr,Lr,0(2),,Lr,hr1(2)), where Jr=[13(r+1),13(r+2)) is taken from the left end of Rr and retained as a new level. Put Rr+1=[13(r+2),1).

The height and width obey h0=1, hr+1=3hr+1 and wr=2/3r+1. Indeed the initial width is 2/3; taking thirds divides it by three, and Jr=3(r+1)3(r+2)=2/3r+2=wr+1. The spacer and the remaining reservoir partition the previous reservoir; all old levels partition into their thirds. Thus by finite induction the new intervals are pairwise disjoint and, together with Rr+1, partition [0,1).

Induction also gives hr=(3r+11)/2: the initial value is one, and 3(3r+11)/2+1=(3r+21)/2. Consequently the tower union Cr=j<hrLr,j has measure hrwr=13(r+1), and the reservoir has measure 3(r+1). Every interval is left-closed and right-open; no endpoint belongs to two levels.

Define Tr on CrLr,hr1 by the unique translation taking Lr,j to Lr,j+1. If their left endpoints are aj,aj+1, that formula is Tr(x)=x+aj+1aj on Lr,j. At stage zero this is the empty partial map. Its range is CrLr,0. The existence of an invertible limiting probability transformation is a separate lemma, not part of the finite definition.

Depends on

Used by

Dependency tree · two levels

27 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