For four finite discrete random variables, we prove that the negative of the Ingleton expression, divided by the joint entropy, is at most $19/124 \approx 0.15323$, improving the previously reported upper bound $3/19$ by $11/2356$. The proof uses a copy program with four copy steps and six auxiliary variables, certified by exact rational linear-programming certificates. We also show that two published information inequalities, due to Dougherty-Freiling-Zeger and Csirmaz, imply the bound $5/32$ by an explicit nonnegative combination with Shannon inequalities, and that $5/32$ is the exact optimum both of the union of the three published inequality catalogues considered here and of the full copy-lemma extensions of all 213 distinct copy programs occurring in them. The new program is not among these programs, and the bound $19/124$ remains optimal when all of them and all catalogue inequalities are added. Ancillary files provide the parsed catalogues, exact primal and dual certificates, exact extension certificates, and verifiers that use only the Python standard library.

翻译：暂无翻译