ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be an n×nn\times n real matrix with n>2n>2. For matrices AA and BB, define

⟨A,B⟩=Ex⟨Ax,Bx⟩=1ntr⁡(ATB),\langle A,B\rangle=\mathbb{E}_x\langle Ax,Bx\rangle=\frac{1}{n}\operatorname{tr}(A^{\mathsf T}B),

where xx is uniformly distributed on Sn−1S^{n-1}, and define the dual Hardy norm by

∥A∥H∗1=sup⁡{⟨A,B⟩:∥B∥H1≤1}.\|A\|_{H^1_*}=\sup\{\langle A,B\rangle:\|B\|_{H^1}\leq 1\}.

Let P2P_2 be a rank-two projection, and set

cn=⟨P2,P2⟩∥P2∥H1∥P2∥H4.c_n=\frac{\langle P_2,P_2\rangle}{\|P_2\|_{H^1}\|P_2\|_{H^4}}.

Near-isometric duality conjecture. For every n×nn\times n matrix AA with n>2n>2,

cn∥A∥H4≤∥A∥H∗1≤∥A∥H4.c_n\|A\|_{H^4}\leq\|A\|_{H^1_*}\leq\|A\|_{H^4}.

This conjectures that the near-isometric duality between the H1H^1 and H4H^4 Hardy norms observed for 2×22\times2 matrices persists in higher dimensions, with the sharp multiplicative loss occurring in the lower bound and determined by a rank-two projection. The parser provides no evidence that the conjecture has been resolved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.