Pith. sign in

REVIEW

Trilinear embedding for divergence-form operators with complex coefficients

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.11694 v3 pith:EBT7G3N3 submitted 2021-01-27 math.AP math.CA

Trilinear embedding for divergence-form operators with complex coefficients

classification math.AP math.CA
keywords omegacoefficientscomplexoperatorselliptictimesarbitrarydivergence-form
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We prove a dimension-free $L^p(\Omega)\times L^q(\Omega)\times L^r(\Omega)\rightarrow L^1(\Omega\times (0,\infty))$ embedding for triples of elliptic operators in divergence form with complex coefficients and subject to mixed boundary conditions on $\Omega$, and for triples of exponents $p,q,r\in(1,\infty)$ mutually related by the identity $1/p+1/q+1/r=1$. Here $\Omega$ is allowed to be an arbitrary open subset of $\mathbb{R}^d$. Our assumptions involving the exponents and coefficient matrices are expressed in terms of a condition known as $p$-ellipticity. The proof utilizes the method of Bellman functions and heat flows. As a corollary, we give applications to (i) paraproducts and (ii) square functions associated with the corresponding operator semigroups, moreover, we prove (iii) inequalities of Kato--Ponce type for elliptic operators with complex coefficients. All the above results are the first of their kind for elliptic divergence-form operators with complex coefficients on arbitrary open sets. Furthermore, the approach to (ii),(iii) through trilinear embeddings seems to be new.

discussion (0)

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