Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pass
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.

A normalised mean-zero H1 atom

Example

Assume Countable Choice. Fix an admissible kernel φ defining H1 and an admissible grand-maximal order N as in Atoms have uniformly bounded Hp quasi-norm and uniformly bounded test pairings. Let Q⊆Rn be a nondegenerate closed axis-parallel cube with centre cQ, and let Q+,Q− be the two halves of Q cut by a coordinate hyperplane through cQ, so that ∣Q+∣=∣Q−∣=∣Q∣/2. Then a=∣Q∣−1(1Q+−1Q−) is a (1,∞,0)-atom: it is supported in Q, it satisfies ∣a∣≤∣Q∣−1 everywhere, and ∫a=0. For the fixed Hφ1 norm, its size satisfies ∥a∥H1≤C1(n,1,0,N,φ) by Atoms have uniformly bounded Hp quasi-norm and uniformly bounded test pairings. This bound is independent of Q and of the position of the halving hyperplane; it records the kernel and grand-maximal-order dependence explicitly.

Facts & Assumptions

Given: Countable Choice, n≥1, the fixed admissible kernel φ and order N, a nondegenerate closed axis-parallel cube Q with volume ∣Q∣ and centre cQ, the halving hyperplane {x0=cQ,0}, and the sets Q+=Q∩{x0>cQ,0}, Q−=Q∩{x0<cQ,0}.

[L1]

A (1,∞,0)-atom is a measurable a with supp⁡a⊆Q, ∣a∣≤∣Q∣−1 a.e. and ∫a=0 (Hp atoms with a prescribed moment order).

[F1]
[F2]

For the fixed kernel φ, ∥a∥Hp:=∥Mφ0a∥Lp (The real Hardy space Hp defined by a radial maximal function); under Countable Choice and for an admissible order N, every (p,∞,s)-atom satisfies ∥MNa∥Lp≤C0(n,p,s) and ∥a∥Hp≤C1(n,p,s,N,φ), uniformly in its supporting cube (Atoms have uniformly bounded Hp quasi-norm and uniformly bounded test pairings).

Proof technique: direct verification of the three defining properties, then the uniform atom bound.

Verification

technique · direct
1.1L1F1algebra

The three atom properties hold. Since 1Q± vanish off Q, supp⁡a⊆Q. Pointwise ∣a∣=∣Q∣−1 on Q+∪Q− and a=0 elsewhere, so ∣a∣≤∣Q∣−1 everywhere. Finally, by [F1], ∫Rna=∣Q∣−1(∫1Q+−∫1Q−)=∣Q∣−1(∣Q∣/2−∣Q∣/2)=0. Hence a is a (1,∞,0)-atom.

2.1step 1.1F2

The H1 estimate. Apply [F2] with p=1 and s=0: since a is a (1,∞,0)-atom, ∥a∥H1≤C1(n,1,0,N,φ). This bound is uniform over the supporting cube and the position of the halving hyperplane, with the fixed kernel and order dependence shown.

3.1step 1.1step 2.1∎

Conclusion. The half-cube difference is a legitimate (1,∞,0)-atom, and its fixed-kernel H1 norm has the uniform bound stated above.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

49 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