ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A⊆[0,1]nA\subseteq[0,1]^n be a weak antichain, meaning that no two distinct points x,y∈Ax,y\in A satisfy xi<yix_i<y_i for every coordinate ii. For each i∈[n]i\in[n], define

A‾i=A∩{(x1,…,xn)∈[0,1]n:xi=min⁡{x1,…,xn}}.\underline{A}_i=A\cap\{(x_1,\ldots,x_n)\in[0,1]^n:x_i=\min\{x_1,\ldots,x_n\}\}.

Define the skewed projection Δi:A‾i→[0,1]n−1\Delta_i:\underline{A}_i\to[0,1]^{n-1} by deleting the iith coordinate after subtracting xix_i from every remaining coordinate:

Δi(x1,…,xn)=(x1−xi,…,xi−1−xi,xi+1−xi,…,xn−xi).\Delta_i(x_1,\ldots,x_n)=(x_1-x_i,\ldots,x_{i-1}-x_i,x_{i+1}-x_i,\ldots,x_n-x_i).

Skewed projection inequality. If AA is a weak antichain, then

Hn−1(A)≤∑i=1nHn−1(Δi(A‾i)).\mathcal H^{n-1}(A)\leq\sum_{i=1}^{n}\mathcal H^{n-1}\bigl(\Delta_i(\underline{A}_i)\bigr).

This proposed extension of projection inequalities replaces orthogonal projections by skewed projections. The source presents it as a belief rather than an established result, and the injectivity of these maps on weak antichains motivates the formulation.

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.