Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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 tower height correlations obstruct mixing

Statement

Assume AC. For the fixed set A=L1,0=[0,2/9) and every r1, μ(AThrA)2/27>4/81=μ(A)2. Consequently Chacon is not strongly mixing. More generally, every measurable E[0,1) satisfies lim infrμ(EThrE)μ(E)/3.

Facts & Assumptions

[F1]

The next Chacon tower stacks left thirds, middle thirds, one spacer and right thirds in that order, with hr=(3r+11)/2 Chacon three cut one spacer towers.

[F2]

The limiting probability transformation agrees with finite tower arrows off a fixed null set Chacon partial maps extend to an invertible map mod null sets.

[F3]

Every measurable set has tower-level-union approximants with symmetric-difference error tending to zero Chacon levels approximate measurable sets.

[F4]

Strong mixing requires convergence of every fixed set-pair correlation to the product of the measures Strong and weak mixing on a probability space.

[F5]

Proof

Given: The normalized Chacon towers and their transformation under AC.

1.1

If Q is any union of levels at stage r, let Q(0) be the union of their left thirds. These disjoint thirds have total measure μ(Q)/3. F1's ordering and F2 show ThrQ(0) is the union of the corresponding middle thirds, modulo the fixed null set. Both unions lie in Q, so Q(0)QThrQ modulo null sets, and μ(QThrQ)μ(Q)/3.

F1F2F5
2.1

The stage-one base is the left third of [0,2/3), hence A=[0,2/9) with measure 2/9. At every later stage it is exactly the union of all its descendant levels, since each old level partitions into three retained thirds. Step 1.1 gives the bound μ(A)/3=2/27 for every r1. But μ(A)2=4/81 and 2/274/81=2/81>0. The heights hr by F1. Thus this one fixed pair (A,A) fails F4's limit, proving failure of strong mixing.

F1F4step 1.1
3.1

For measurable E, F3 gives stage-r level unions Qr with ηr=μ(EQr)0. The symmetric difference of EThrE and QrThrQr lies in (EQr)Thr(EQr). Measure preservation bounds its measure by 2ηr, while μ(Qr)μ(E)ηr. Step 1.1 therefore yields μ(EThrE)μ(E)/3(7/3)ηr. Taking the liminf proves the general assertion. AC is inherited from F1–F3 and permits the countable choice of approximants; the estimate remains valid for null or conull E without division.

F2F3F5step 1.1

Depends on

Used by

Dependency tree · two levels

19 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