A colorful quantitative Helly theorem for volume

Abstract: We prove a colorful quantitative Helly theorem for volume with the optimal number $2d$ of colors. If every rainbow intersection from $2d$ finite families of convex sets in $\R<sup>d$ has volume at least one, then the intersection of one family has volume at least $d<sup>{-O(d<sup>2)}$. We also prove a colorful quantitative Steinitz theorem for origin-centered ellipsoids of different shapes. The proof uses a common normalization of positive operators and a lift that produces two rainbow bases with large determinants.