Alphabeta Math
Pipeline-generated
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 Carleson–Hunt Time–Frequency Theorem: Examples

1 · Prerequisites

2 · Summary

Two explicit tiles illustrate the reversed frequency inclusion in the tile order. A second pair has equal frequency intervals and disjoint spatial intervals, and is incomparable in both directions. Half-open endpoints make each inclusion and non-inclusion unambiguous.

The numerical series nZmin(2n,2n)=3 displays the two summable tails that motivate balancing size and density levels. The forest lemma proves the stopping decomposition whose final sum is bounded by this identity. The endpoint remark applies the earlier Kolmogorov witness to exclude a bound on all of L1; the positive Carleson–Hunt bounds concern the strict range 1<p<infinity.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Two comparable and two incomparable carleson tiles

Example

Let s=[0,1)×[0,1) and t=[0,2)×[0,1/2). Then st. The tiles u=s and v=[1,2)×[0,1) are incomparable.

Facts & Assumptions

Given: The four explicitly specified rectangles in the example.

[F1]

The finite interval and tile-order conventions are those of Carleson tiles wave packets and tile order. Only these combinatorial clauses are used; no Fourier or choice-dependent construction is used.

Proof

1.1

All four displayed intervals are half-open dyadic intervals. The area products are 11=1 for s,u,v and 2(1/2)=1 for t. Moreover [0,1)[0,2) and [0,1/2)[0,1), so st by the two defining inclusions. The reverse order fails because 1[0,2) but 1[0,1).

F1algebra
1.2

For u,v the frequency intervals agree, but neither spatial interval contains the other: 0IuIv and 1IvIu. Thus both possible order relations fail, while every tile is comparable to itself.

F1algebra
2.1

Steps 1.1 and 1.2 verify the claimed comparable pair and the two failures for the incomparable pair, with midpoint and endpoint membership fixed by the half-open convention.

step 1.1step 1.2
ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)Open item page →

Balancing density and size levels in the carleson sum

Example

The nonnegative two-sided series satisfies nZmin(2n,2n)=3.

Facts & Assumptions

Given: The displayed explicitly indexed nonnegative series, interpreted as the supremum of its finite subsums.

Proof

1.1

For n0 the minimum is 2n, whereas for n1 it is 2n. Finite geometric cancellation therefore gives, for integers M1 and N0, n=MNmin(2n,2n)=(12M)+(22N)=32M2N. In particular the index zero is counted once and contributes one.

givenalgebra
2.1

Every finite set of integer indices lies in an interval [M,N] of the above form, and all summands are nonnegative. Thus the supremum of finite subsums is bounded above by three by step 1.1. Taking M=N in that same formula gives the lower bound three, since 2M0. The series is therefore three.

step 1.1algebra
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)Open item page →

Carleson hunt does not include the lone endpoint

Statement

Assume AC as in the Kolmogorov construction. Its L1(T) witness excludes a bound for the Fourier partial-sum maximal operator on all of L1. The proposed Carleson–Hunt theorem concerns only 1<p<; this endpoint observation does not establish any of those positive bounds.

Facts & Assumptions

Given: Normalized Haar measure on the circle and the Kolmogorov witness f.

[F1]

The locally authored conclusion of Kolmogorov lone fourier series diverges almost everywhere gives fL1 with unbounded symmetric partial sums almost everywhere. The unavailable original backing was separately resolved by the owner using the complete local proof; no original-source retrieval is claimed.

[F2]

The Axiom of Choice is inherited from the countable construction of that witness.

Proof

1.1

Put Mf=supN0SNf. Each finite partial sum is measurable, hence this countable supremum is measurable. By F1 it equals infinity outside a null set on a space of measure one. For every positive integer k, the nonnegative simple function k on that conull set is bounded above by Mf, so the definition of the nonnegative integral gives Mfk. Consequently Mf1=.

F1F2givenalgebra
2.1

Since f1< by F1, step 1.1 contradicts every proposed finite-constant inequality Mh1Ch1 for all hL1. It also contradicts every finite weak-(1,1) constant: m{Mf>t}=1 for all t, whereas Cf1/t<1 for sufficiently large t. Thus neither assertion follows by adjoining the endpoint to the proposed positive-p range.

F1step 1.1algebra

Sources