Let $x,y,z$ be distinct reals and consider the expression $$L=\frac{(|x|+|y|+|z|)^3}{|(x-y)(x-z)(y-z)|}$$ Find the minimum possible value of $L$ over all $(x,y,z)$.
My work
Using a calculator, the answer seems to be $4$. One way of achieving this is when $x=1,y=-1,z=0$. I am not sure how to prove that this is the minimum, but the fact that $4$ is a square may lead to something, via the Cauchy-Schwarz inequality for example.
Also, I think we can assume $x\geq y\geq z$ because of something to do with symmetry? (Not sure on this). Then we can just consider lots of cases (E.g. $x\geq y\geq0\geq z$, etc.) and then simplify the absolute value expressions, making it easier to determine the minimum).
My final thought is if there is a geometric solution. Since absolute values represent area, I'm wondering if we can consider certain points in the plane and use something like the triangle inequality to finish. This seems unlikely though, as $(x-y)(x-z)(y-z)$ doesn't seem to have a particularly nice geometric interpretation.
EDIT: This question, coming from a contest, was implicitly designed not to have calculus-based solutions, so I'd appreciate if answers didn't use calculus.
The expression for $L$ does not change if $x, y,z$ are permuted, so you may indeed assume that $x > y > z$.
With $a = x-y > 0$ and $b = y-z > 0$ we have $$ |x| + |y| + |z| \ge x-z = a+b $$ and $$ |(x-y)(x-z)(y-z)| = a(a+b)b $$ and therefore $$ L \ge \frac{(a+b)^3}{a(a+b)b} = \frac{(a+b)^2}{ab} = \frac{(a-b)^2}{ab} + 4 \ge 4\, . $$
Equality holds exactly if $y=0$ and $a=b$, i.e. for $(x,y,z) = (a, 0, -a)$ with $a > 0$.