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.
Carleson size selection
Statement
Assume AC. For a finite family of size sigma>0, choose trees with total top length <=C sigma^(-2)||f||_2^2, leaving size <=sigma/2.
Facts & Assumptions
Size is the supremum of the normalized squared coefficient sums over plus trees, including singleton trees; it decreases on subcollections. Count sums designated top lengths with multiplicity Density size and tree count for carleson tiles.
Tiles, plus trees and the fixed packets have the stated dyadic order, Fourier supports strictly inside the lower frequency halves, and Schwartz decay at every integer exponent Carleson tiles wave packets and tile order.
Plancherel preserves the complex inner product Plancherel theorem.
The complex pairing is first-variable-linear, has squared norm on the diagonal and satisfies Cauchy–Schwarz The complex pairing is well-defined and satisfies Cauchy–Schwarz.
Assume AC The Axiom of Choice, sufficient for the countable-choice Fourier interfaces in F2 and F3.
Proof
Given: A finite tile set S, , and . Put . Constants below depend only on the fixed packet.
Call a plus tree with top t strict when for every member s, so its top is not a member. Any plus tree can be made strict by replacing its top t with . This is a tile, dominates all its members, and satisfies the strict condition even for s=t. Its top length is twice the old length. Consequently, whenever a stock R has size greater than , it has a strict plus subtree U with top t and . Indeed the supremum in F1 then has a witness with normalized sum greater than , and the replacement divides that sum by two.
For , packet decay implies To prove it, use exponent 40 in F2. For each x, the factor is at most . Extract its inverse twentieth power from the product of the two decay factors. The remaining integral is at most . Multiplying by proves the bound. By F3, a Gram entry is zero when the two lower frequency halves are disjoint.
Starting with R=S, consider all strict witnesses satisfying the threshold inequality of step 1.1. Only finitely many possible tops occur: if and , their lengths lie between and . There are finitely many dyadic scales in this range. Each top dominates some s in S, so its spatial interval is the unique ancestor of at its scale, and its frequency interval is one of finitely many dyadic subintervals of at its prescribed length. Choose a possible top of minimum frequency center, breaking ties by any fixed ordering of this finite list, and choose a strict witness U for that top. Remove the full tree , record U and V with that same top, and repeat. The process stops after at most |S| removals because every witness is nonempty. Possible witnesses only disappear as R shrinks, so the selected top-frequency centers are nondecreasing. At termination the residual size is at most by step 1.1. The V are disjoint tile collections, as are their subsets U.
The strict witnesses have the following separation property. If , belong to different recorded witnesses and , dyadic nesting implies . Thus the top-frequency interval of U lies in , while that of U' lies in . The former center is smaller, so U was selected earlier. If met , the inequalities and dyadic nesting would give . Together with this would have removed s' with the earlier full tree. Hence . Within one strict plus tree, distinct lower frequency halves are disjoint: if two unequal such halves were nested, the full smaller frequency interval would lie in the larger lower half, whereas the common top frequency must lie in its upper half. Equal lower halves mean equal full frequencies and equal spatial scales; distinct tiles then have disjoint spatial intervals.
Let be the recorded strict witnesses, , , and . The witness threshold and original size give when . The part of the Gram expansion of with equal lower frequency halves has absolute value at most CQ. In fact, for each fixed frequency the spatial intervals form a subset of the lattice of intervals of its fixed length l. Step 1.2 bounds the row sums and column sums by . This series is finite by comparison with the integral of on . Apply and sum the row and column bounds.
For fixed consider all witness tiles s' whose lower frequency halves properly contain . They belong to other witnesses by step 3.1, and their spatial intervals lie outside . These intervals are pairwise disjoint. To check this, two corresponding lower frequency halves both contain , so are nested. If unequal, their owning witnesses must differ by step 3.1; applying its separation property to that pair makes the smaller spatial interval disjoint from the other one's entire top interval, hence from the other spatial interval. If equal, they have the same scale and different spatial intervals. Put . Since , the values and on differ by at most a fixed factor: their denominators before taking the twentieth power differ by at most . Therefore All sums here are finite.
Singleton trees in F1 give . Combining this with step 1.2 bounds an oriented unequal-frequency Gram term by . Thus step 4.1 bounds all such terms by For a fixed top interval J and a fixed scale l<=|J|, at most one frequency interval can occur above a given spatial interval of that scale: it must be the unique dyadic ancestor of the top frequency of length 1/l. Thus the spatial intervals at that scale form a subset of the dyadic subintervals of J. Write and index the full list from k=0 to m-1. Direct integration on the two exterior half-lines bounds Indeed the exact two denominators are and , with factor . The sum over k is at most Cl by integral comparison with . Summing over the dyadic scales , j>=0, gives at most C|J| by the geometric sum. The oriented contribution is consequently at most ; its conjugate orientation satisfies the same bound.
Steps 3.2 and 5.1, and the vanishing of every remaining Gram entry in step 1.2, give . By the first-variable-linear convention, , so F4 gives . If L>0, combine this with and divide by to obtain . If no witness was selected, L=0 and the bound is immediate. The removed full trees V have these same tops, so this is their forest count, while step 2.1 gives the required residual size. No assumption that distinct top intervals are disjoint was made. All selections are finite; AC is inherited solely from the Fourier interfaces identified in F5.
Depends on
Used by
Dependency tree · two levels
31 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
- Lacey, Carleson’s Theorem: Proof, Complements, Variations (standard reference, not scraped)