ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PdP_d be the set of probability vectors in dimension dd, and let x,y∈Pdx,y\in P_d have nonzero coordinates. Write x≺yx\prec y for majorization, and write x≺Myx\prec_M y if there exists an integer m≥1m\ge 1 such that x⊗m≺y⊗mx^{\otimes m}\prec y^{\otimes m}. Define Np(x)=∑i=1dxipN_p(x)=\sum_{i=1}^d x_i^p. Are the following equivalent?

  1. Np(x)≤Np(y)N_p(x)\le N_p(y) for every p≥1p\ge 1, Np(x)≥Np(y)N_p(x)\ge N_p(y) for every p∈[0,1]p\in[0,1], and Np(x)≤Np(y)N_p(x)\le N_p(y) for every p≤0p\le 0;
  2. There exists a sequence (xn)(x_n) in PdP_d, converging to xx in the ℓ1\ell_1 norm, such that xn≺Myx_n\prec_M y for every nn.

Equivalently, does Theorem 1 remain true when ≺C\prec_C is replaced by ≺M\prec_M?

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.