pith. sign in

arxiv: 2606.16760 · v2 · pith:7TIDWCPEnew · submitted 2026-06-15 · 🧮 math.CV · math.CA

On the Bloch and mathcal Q_p--Carleson measure problems

Bingyang Hu , Xiaojing Zhou This is my paper

Pith reviewed 2026-06-27 02:13 UTC · model grok-4.3

classification 🧮 math.CV math.CA
keywords Bloch spaceCarleson measuresQ_p spacesdyadic resolutionsembeddingsboundednesscompactnesssemidefinite programming
0
0 comments X

The pith

A Bloch capacity from an admissible dyadic resolution fully characterizes boundedness and compactness of the embedding from the Bloch space into L²(μ).

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a complete characterization of when the natural embedding from the Bloch space into square-integrable functions with respect to a positive Borel measure μ on the unit disk is bounded or compact. The criterion is expressed through a Bloch capacity that is defined using any admissible dyadic resolution of the disk. The identical criterion applies to the embedding from the Q_p spaces when 0 < p ≤ 1. Readers interested in analytic function spaces would care because the result identifies exactly which measures are Carleson measures for these spaces and therefore controls integrability of the functions and their derivatives.

Core claim

For a positive Borel measure μ on the unit disk, the embedding id: B → L²(μ) is bounded if and only if the Bloch capacity B_R(μ) is finite and compact if and only if B_R(μ) vanishes, where B_R is constructed from an admissible dyadic resolution R of the disk. The same equivalences hold for the embedding id: Q_p → L²(μ) when 0 < p ≤ 1. The argument represents functions via the Bergman projection, takes conditional expectations relative to R, and reduces the resulting inequalities to the solvability of a finite-dimensional semidefinite program.

What carries the argument

The Bloch capacity B_R(μ) associated with an admissible dyadic resolution R of the disk, which reduces the embedding question to finiteness or vanishing of this capacity via conditional expectations and semidefinite programming.

If this is right

  • Boundedness of the embedding id: B → L²(μ) holds exactly when B_R(μ) is finite.
  • Compactness of the embedding holds exactly when B_R(μ) vanishes.
  • The same equivalences decide boundedness and compactness for id: Q_p → L²(μ) when 0 < p ≤ 1.
  • Carleson measures for the Bloch and Q_p spaces can be tested by checking the associated capacity through the dyadic semidefinite program.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The method supplies a concrete computational test for specific measures once a resolution R is fixed.
  • The same dyadic reduction could be attempted for embeddings involving other spaces whose functions are controlled by derivatives.
  • Different choices of admissible resolution might produce capacities with different numerical values but the same finiteness behavior.

Load-bearing premise

There exists an admissible dyadic resolution of the disk such that conditional expectations combined with the Bergman projection representation reduce the embedding boundedness question exactly to the solution of a finite-dimensional semidefinite program.

What would settle it

A positive Borel measure μ for which the embedding from B to L²(μ) is bounded yet the Bloch capacity B_R(μ) is infinite for every admissible dyadic resolution R, or the converse situation.

Figures

Figures reproduced from arXiv: 2606.16760 by Bingyang Hu, Xiaojing Zhou.

Figure 1
Figure 1. Figure 1: The partition R5 in an admissible dyadic resolution on D. Lemma 2.3. Let R = {RN }N≥0 be defined as above. Then R is an admissible dyadic resolution in D in the sense of Definition 1.1. Proof. Conditions (a) and (b) follow directly from the corresponding facts for the dyadic squares SN,j,k in [0, 1)2 , up to sets of area zero arising from the boundary identifications in the polar parametrization. It remain… view at source ↗
read the original abstract

In this paper, we study the Bloch and $\mathcal Q_p$--Carleson measure problems on the unit disc $\mathbb D$. In the Bloch case, for a positive Borel measure $\mu$ on $\mathbb D$, we give a complete characterization of the boundedness and compactness of the embedding $$ \operatorname{id}:\mathcal B \longrightarrow L^2(\mu) $$ in terms of the Bloch capacity $\mathfrak B_{\mathcal R}(\mu)$ associated with an admissible dyadic resolution $\mathcal R$ of $\mathbb D$. The proof is based on the Bergman projection representation of Bloch functions, conditional expectations on admissible dyadic resolutions, and a finite-dimensional semidefinite programming argument. We also adapt this dyadic framework to the more general $\mathcal Q_p$--Carleson measure problem and obtain a corresponding complete boundedness and compactness characterization for $$ \operatorname{id}:\mathcal Q_p \longrightarrow L^2(\mu), \qquad 0<p\le1. $$ This work further develops the dyadic approach introduced in our recent work on composition operators on $\mathcal Q_p$ spaces, but in a different setting where the embedding involves recovering function values from derivative information.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper claims a complete characterization of boundedness and compactness for the embeddings id: Bloch space → L²(μ) and id: Q_p → L²(μ) (0 < p ≤ 1) on the unit disk, expressed via a Bloch capacity B_R(μ) associated to an admissible dyadic resolution R of D. The argument relies on the Bergman projection representation of the functions, conditional expectations with respect to R, and reduction of the embedding question to a finite-dimensional semidefinite program.

Significance. If the claimed equivalence holds, the result would supply an explicit, dyadic capacity criterion together with a computational test (via SDP) for these Carleson-type embedding problems. This extends the authors’ earlier dyadic framework from composition operators to a different setting that recovers function values from derivative information, and could be useful for both theoretical and numerical work on Bloch and Q_p spaces.

major comments (1)
  1. [Proof of the main theorem (Bloch case)] The load-bearing step is the exact equivalence between the embedding norm and the value of the finite-dimensional SDP obtained from conditional expectations on R and the Bergman projection. The manuscript must verify that this discretization introduces neither loss nor inflation of the norm; without an explicit error bound or invariance argument, the characterization remains conditional on that reduction.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive comment on the proof of the main theorem. We address the point below and indicate the planned revision.

read point-by-point responses

  1. Referee: [Proof of the main theorem (Bloch case)] The load-bearing step is the exact equivalence between the embedding norm and the value of the finite-dimensional SDP obtained from conditional expectations on R and the Bergman projection. The manuscript must verify that this discretization introduces neither loss nor inflation of the norm; without an explicit error bound or invariance argument, the characterization remains conditional on that reduction.

    Authors: The referee correctly identifies the central reduction. The manuscript establishes the equivalence via the compatibility of admissible dyadic resolutions with the Bergman projection (Definition 2.3 and the calculations in Section 3), which ensures the conditional expectations preserve the relevant norms exactly. However, we agree that an explicit invariance statement or error bound would strengthen the presentation and remove any ambiguity. We will add a short lemma in the revised version that quantifies the discretization error and confirms it is zero under the admissibility condition. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The abstract cites prior work by the same authors on composition operators but explicitly distinguishes the current setting as different (embedding via derivative information rather than composition). The claimed characterization of id: B → L²(μ) and id: Q_p → L²(μ) is stated to rest on Bergman projection representations, conditional expectations with respect to an admissible dyadic resolution R, and a finite-dimensional SDP argument. No equation or definition in the supplied text reduces the new Bloch capacity B_R(μ) to a quantity fitted or defined in the cited prior work; the central claim therefore retains independent content and does not collapse by construction to its inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The abstract invokes standard tools of complex analysis (Bergman projection) and dyadic harmonic analysis (conditional expectations on admissible resolutions) without introducing new free parameters or invented entities visible at this level.

axioms (1)
  • domain assumption Existence and properties of admissible dyadic resolutions of the unit disk that support conditional expectations compatible with the Bergman projection.
    Invoked to reduce the embedding to a semidefinite program.

pith-pipeline@v0.9.1-grok · 5743 in / 1360 out tokens · 40216 ms · 2026-06-27T02:13:41.600725+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

8 extracted references · 1 linked inside Pith

  1. [1]

    Arcozzi, R

    N. Arcozzi, R. Rochberg and E. Sawyer, Carleson measures for analytic Besov spaces,Rev. Mat. Iberoam. 18(2002), no. 2, 443–510

    2002

  2. [2]

    G. Bao, J. Du, H. Wulan and K. Zhu, Carleson measures for the Bloch space,Studia Math.277(2024), no. 2, 99–122

    2024

  3. [3]

    Girela, J

    D. Girela, J. ´A. Pel´ aez, F. P´ erez-Gonz´ alez and J. R¨ atty¨ a, Carleson measures for the Bloch space,Integr. Equ. Oper. Theory61(2008), no. 4, 511–547

    2008

  4. [4]

    Hu and X

    B. Hu and X. Zhou, A non-testing characterization of bounded and compact composition operators on Qp spaces, preprint, arXiv:2606.08907, 2026

    Pith/arXiv arXiv 2026

  5. [5]

    J. ´A. Pel´ aez and J. R¨ atty¨ a, Bergman projection induced by radial weight,Adv. Math.391(2021), Paper No. 107950, 70 pp. 30 BINGYANG HU AND XIAOJING ZHOU

    2021

  6. [6]

    Pisier, Grothendieck’s theorem, past and present,Bull

    G. Pisier, Grothendieck’s theorem, past and present,Bull. Amer. Math. Soc. (N.S.)49(2012), no. 2, 237–323

    2012

  7. [7]

    Vandenberghe and S

    L. Vandenberghe and S. Boyd, Semidefinite programming,SIAM Rev.38(1996), no. 1, 49–95

    1996

  8. [8]

    Xiao,GeometricQ p Functions, Frontiers in Mathematics, Birkh¨ auser, Basel, 2006

    J. Xiao,GeometricQ p Functions, Frontiers in Mathematics, Birkh¨ auser, Basel, 2006. (Bingyang Hu) Department of Mathematics and Statistics, Auburn University, Auburn, Alabama, U.S.A, 36849 Email address:bzh0108@auburn.edu (Xiaojing Zhou) Department of Mathematics and Statistics, Auburn University, Auburn, Alabama, U.S.A, 36849 Email address:xiz0003@auburn.edu

    2006