Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Complex circle measures have finite regular total variation under countable choice

Statement

Assume countable choice. Every finite-valued countably additive complex Borel measure ν on T has ∣ν∣(T)<∞, and ∣ν∣ is a finite regular positive Borel measure. The zero complex measure is allowed. No Hahn or Jordan decomposition is required.

Facts & Assumptions

Given: Countable choice and a complex Borel measure ν:B(T)→C.

[F1]

A complex measure is finite-valued and countably additive on every given disjoint sequence. Its total variation is the supremum of sums ∑j∣ν(Ej)∣ over countable Borel partitions of a set. (A complex measure is a finite-valued countably additive set function, The total variation |nu|(E) from countable measurable partitions, The Axiom of Countable Choice (ACω))

[F2]

A finite family of nonempty sets has a choice function without a choice axiom. (Every natural-number-indexed list of nonempty sets has a choice function on its family of values)

[F3]

Under CC, Borel measures finite on compact sets on a second-countable LCH space are regular. The circle is compact and metrizable. (Locally finite Borel measures on second-countable LCH spaces are regular, The one-dimensional torus and its normalized Haar integral)

Proof

1.1F1givenconstructalgebra

For every supplied disjoint Borel sequence (Dj), ∑j∣ν(Dj)∣ is finite. To see this directly from [F1], split the real parts into their nonnegative and negative index groups. On each group, replace other cells by the empty set; [F1] says the complex series converges to the finite measure of that group's union. Its real part therefore has a finite sum of terms of one sign. Thus ∑j∣Re⁡ν(Dj)∣<∞. The two imaginary sign groups give ∑j∣Im⁡ν(Dj)∣<∞ as well. Since ∣z∣≤∣Re⁡z∣+∣Im⁡z∣, the asserted absolute sum is finite. Empty groups cause zero sums.

2.1F1step 1.1givenconstructalgebra

Suppose ∣ν∣(T)=∞. For each n≥0 there is a finite ordered Borel partition Pn with sum of absolute measures greater than 2n: take a finite initial portion of a countable partition whose sum exceeds that threshold, and append its complement. CC supplies the sequence (Pn). Let Qn be the finite common refinement of P0,…,Pn, ordered lexicographically by their cell indices; empty cells may be retained. For Borel E put Sn(E)=∑C∈Qn∣ν(E∩C)∣,V(E)=sup⁡nSn(E). Refinement and the triangle inequality make Sn(E) nondecreasing, and V(T)=∞. For any fixed m, refinement gives Sn(E)=∑C∈QmSn(E∩C) for n≥m; passing to the limit in this finite sum gives V(E)=∑C∈QmV(E∩C).

3.1F1step 1.1step 2.1constructalgebra

Define a nested sequence deterministically, starting with E0=T and index m0=−1. Given V(Ek)=∞, take the least n>mk for which Sn(Ek)>∣ν(Ek)∣+2. Among the finitely many cells of Qn contained in Ek, choose the first C with V(C)=∞, possible by the finite-sum identity in step 2.1. Set Ek+1=C, mk+1=n, and retain all other cells of the refinement inside Ek as side cells Dk,j. Here Ek is a cell of the previous refinement for k>0, so the new cells partition it. Write sk=∑j∣ν(Dk,j)∣. Finite additivity gives ∣ν(C)∣≤∣ν(Ek)∣+sk, while Sn(Ek)=∣ν(C)∣+sk, hence sk≥Sn(Ek)−∣ν(Ek)∣2>1. Side cells from different stages are disjoint, since later parents lie in the retained nested child. Concatenating the prescribed finite ordered side lists is a disjoint countable Borel sequence with total absolute sum ∑ksk=∞, contradicting step 1.1. The recursion uses least natural numbers and first indices in supplied finite lists; it spends no dependent choice. Therefore ∣ν∣(T)<∞.

4.1F1F2step 3.1constructalgebra

We also prove that variation is a measure directly. It has value zero on the empty set. Let E=⨆jEj be a supplied disjoint Borel union. Every piece has finite variation by step 3.1, since its partitions extend to partitions of the circle by appending the complement. For fixed N and epsilon, choose partitions of the first N+1 pieces within ε/(N+1) of their variation suprema; [F2] supplies these finitely many choices. Concatenate their cells and append the remainder of E. The resulting partition gives ∣ν∣(E)≥∑j=0N∣ν∣(Ej)−ε. Let epsilon decrease to zero and then N increase to infinity. Conversely, for every partition (Bl) of E, countable additivity gives ∣ν(Bl)∣≤∑j∣ν(Bl∩Ej)∣. Summing and interchanging the two nonnegative series yields ∑l∣ν(Bl)∣≤∑j∣ν∣(Ej). Taking the supremum over partitions proves the reverse bound. Thus ∣ν∣ is a finite positive Borel measure.

5.1F3step 3.1step 4.1algebra∎

Step 4.1 and the finiteness from step 3.1 meet [F3], which gives regularity on the circle. For nu zero all sums are zero. CC was used only for the independent partition sequence in step 2.1 and the regularity theorem; the recursive refinement is deterministic and the measure proof uses only finite choice.

Depends on

Used by

Dependency tree · two levels

63 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