{
  "index": "2016-A-6",
  "type": "ANA",
  "tag": [
    "ANA",
    "ALG"
  ],
  "difficulty": "",
  "question": "Find the smallest constant $C$ such that for every real polynomial $P(x)$ of degree 3 that has a root in the interval $[0,1]$,\n\\[\n\\int_0^1 \\left| P(x) \\right|\\,dx \\leq C \\max_{x \\in [0,1]} \\left| P(x) \\right|.\n\\]",
  "solution": "We prove that the smallest such value of $C$ is $5/6$.\n\n\\noindent\n\\textbf{First solution:}\n(based on a suggestion of Daniel Kane)\n\nWe first reduce to the case where $P$ is nonnegative in $[0,1]$ and $P(0) = 0$.\nTo achieve this reduction, suppose that a given value $C$ obeys the inequality for such $P$.\nFor $P$ general,\ndivide the interval $[0,1]$ into subintervals $I_1,\\dots,I_k$ at the roots of $P$.\nWrite $\\ell(I_i)$ for the length of the interval $I_i$; since each interval is bounded by a root of $P$, we may make a linear change of variable to see that\n\\[\n\\int_{I_i} |P(x)|\\,dx \\leq C \\ell(I_i) \\max_{x \\in I_i} |P(x)| \\quad (i=1,\\dots,k).\n\\]\nSumming over $i$ yields the desired inequality.\n\nSuppose now that $P$ takes nonnegative values on $[0,1]$, $P(0) = 0$, and $\\max_{x \\in [0,1]} P(x) = 1$. Write $P(x) = ax^3 + bx^2 + cx$ for some $a,b,c \\in \\RR$; then\n\\begin{align*}\n\\int_0^1 P(x)\\,dx &= \\frac{1}{4} a + \\frac{1}{3} b + \\frac{1}{2} c \\\\\n&= \\frac{2}{3} \\left( \\frac{1}{8} a + \\frac{1}{4} b + \\frac{1}{2} c \\right)\n+ \\frac{1}{6} (a+b+c) \\\\\n&= \\frac{2}{3} P\\left( \\frac{1}{2} \\right) + \\frac{1}{6} P(1) \\\\\n&\\leq \\frac{2}{3} + \\frac{1}{6} = \\frac{5}{6}.\n\\end{align*}\nConsequently, the originally claimed inequality holds with $C = 5/6$. To prove that this value is best possible, it suffices to exhibit a polynomial $P$ as above with $\\int_0^1 P(x)\\,dx = 5/6$; we will verify that\n\\[\nP(x) = 4x^3 - 8x^2 + 5x\n\\]\nhas this property. It is apparent that $\\int_0^1 P(x)\\, dx =5/6$.\nSince $P'(x) = (2x-1)(6x-5)$ and \n\\[\nP(0) = 0, \\,P\\left( \\frac{1}{2} \\right) = 1, \\,\nP\\left( \\frac{5}{6} \\right) = \\frac{25}{27}, P(1) = 1,\n\\]\nit follows that $P$ increases from 0 at $x=0$ to 1 at $x=1/2$, then decreases to a positive value at $x=5/6$, then increases to 1 at $x=1$. Hence $P$ has the desired form.\n\n\\noindent\n\\textbf{Remark:}\nHere is some conceptual motivation for the preceding solution.\nLet $V$ be the set of polynomials of degree at most 3 vanishing at 0, viewed as a three-dimensional vector space over $\\RR$.\nLet $S$ be the subset of $V$ consisting of those polynomials $P(x)$ for which\n$0 \\leq P(x) \\leq 1$ for all $x \\in [0,1]$; this set is convex and compact. We may then compute the minimal $C$ as the maximum value of $\\int_0^1 P(x)\\,dx$ over all $P \\in S$, provided that the maximum is achieved for some polynomial of degree exactly 3. (Note that any extremal polynomial must satisfy\n$\\max_{x \\in [0,1]} P(x) = 1$, as otherwise we could multiply it by some constant $c>1$ so as to increase $\\int_0^1 P(x)\\,dx$.)\n\nLet $f: V \\to \\RR$ be the function taking $P(x)$ to $\\int_0^1 P(x)\\,dx$. This function is linear, so we can characterize its extrema on $S$ easily: there exist exactly two level surfaces for $f$ which are supporting planes for $S$, and the intersections of these two planes\nwith $S$ are the minima and the maxima. It is obvious that the unique minimum is achieved by the zero polynomial, so this accounts for one of the planes.\n\nIt thus suffices to exhibit a single polynomial $P(x) \\in S$ such that the level plane of $f$ through $P$ is a supporting plane for $S$. \nThe calculation made in the solution amounts to verifying that\n\\[\nP(x) = 4x^3 - 8x^2 + 5x\n\\]\nhas this property, by interpolating between the constraints $P(1/2) \\leq 1$ and $P(1) \\leq 1$.\n\nThis still leaves the matter of correctly guessing the optimal polynomial. If one supposes that it should be extremized both at $x=1$ and at an interval value of the disc, it is forced to have the form $P(x) = 1 + (x-1)(cx-1)^2$ for some $c>0$; the interpolation property then pins down $c$ uniquely.\n\n\\noindent\n\\textbf{Second solution:}\n(by James Merryfield, via AoPS)\nAs in the first solution, we may assume that $P$ is nonnegative on $[0,1]$ and $P(0)= 0$.\nSince $P$ has degree at most 3, Simpson's rule for approximating $\\int_0^1 P(x)\\,dx$ is an exact formula:\n\\[\n\\int_0^1 P(x)\\,dx = \\frac{1}{6}( P(0) + 4 P\\left( \\frac{1}{2} \\right) + P(1)).\n\\]\nThis immediately yields the claimed inequality for $C = 5/6$. Again as in the first solution,\nwe obtain an example showing that this value is best possible.",
  "vars": [
    "I_i",
    "P",
    "S",
    "V",
    "f",
    "i",
    "k",
    "\\\\ell",
    "x"
  ],
  "params": [
    "C",
    "a",
    "b",
    "c"
  ],
  "sci_consts": [],
  "variants": {
    "descriptive_long": {
      "map": {
        "I_i": "subintvl",
        "P": "polynom",
        "S": "subsetset",
        "V": "vectorsp",
        "f": "funclinear",
        "\\ell": "lengthfn",
        "x": "realvar",
        "C": "bestconst",
        "a": "coeffa",
        "b": "coeffb",
        "c": "coeffc"
      },
      "question": "Find the smallest constant bestconst such that for every real polynomial polynom(realvar) of degree 3 that has a root in the interval [0,1],\n\\[\n\\int_0^1 \\left| polynom(realvar) \\right|\\,drealvar \\leq bestconst \\max_{realvar \\in [0,1]} \\left| polynom(realvar) \\right|.\n\\]",
      "solution": "We prove that the smallest such value of bestconst is 5/6.\n\n\\noindent\n\\textbf{First solution:}\n(based on a suggestion of Daniel Kane)\n\nWe first reduce to the case where polynom is nonnegative in [0,1] and polynom(0) = 0.\nTo achieve this reduction, suppose that a given value bestconst obeys the inequality for such polynom.\nFor polynom general,\ndivide the interval [0,1] into subintervals I_1,\\dots,I_k at the roots of polynom.\nWrite lengthfn(subintvl) for the length of the interval subintvl; since each interval is bounded by a root of polynom, we may make a linear change of variable to see that\n\\[\n\\int_{subintvl} |polynom(realvar)|\\,drealvar \\leq bestconst \\, lengthfn(subintvl) \\max_{realvar \\in subintvl} |polynom(realvar)| \\quad (i=1,\\dots,k).\n\\]\nSumming over i yields the desired inequality.\n\nSuppose now that polynom takes nonnegative values on [0,1], polynom(0) = 0, and \\max_{realvar \\in [0,1]} polynom(realvar) = 1. Write polynom(realvar) = coeffa realvar^3 + coeffb realvar^2 + coeffc realvar for some coeffa,coeffb,coeffc \\in \\RR; then\n\\begin{align*}\n\\int_0^1 polynom(realvar)\\,drealvar &= \\tfrac14 \\, coeffa + \\tfrac13 \\, coeffb + \\tfrac12 \\, coeffc \\\\\n&= \\tfrac23 \\left( \\tfrac18 \\, coeffa + \\tfrac14 \\, coeffb + \\tfrac12 \\, coeffc \\right)\n+ \\tfrac16 (coeffa+coeffb+coeffc) \\\\\n&= \\tfrac23 \\, polynom\\!\\left( \\tfrac12 \\right) + \\tfrac16 \\, polynom(1) \\\\\n&\\le \\tfrac23 + \\tfrac16 = \\tfrac56.\n\\end{align*}\nConsequently, the originally claimed inequality holds with bestconst = 5/6. To prove that this value is best possible, it suffices to exhibit a polynomial polynom as above with \\int_0^1 polynom(realvar)\\,drealvar = 5/6; we will verify that\n\\[\npolynom(realvar) = 4\\,realvar^3 - 8\\,realvar^2 + 5\\,realvar\n\\]\nhas this property. It is apparent that \\int_0^1 polynom(realvar)\\, drealvar = 5/6.\nSince polynom'(realvar) = (2\\,realvar-1)(6\\,realvar-5) and \n\\[\npolynom(0) = 0,\\; polynom\\!\\left( \\tfrac12 \\right) = 1,\\; \npolynom\\!\\left( \\tfrac56 \\right) = \\tfrac{25}{27},\\; polynom(1) = 1,\n\\]\nit follows that polynom increases from 0 at realvar=0 to 1 at realvar=1/2, then decreases to a positive value at realvar=5/6, then increases to 1 at realvar=1. Hence polynom has the desired form.\n\n\\noindent\n\\textbf{Remark:}\nHere is some conceptual motivation for the preceding solution.\nLet vectorsp be the set of polynomials of degree at most 3 vanishing at 0, viewed as a three-dimensional vector space over \\RR.\nLet subsetset be the subset of vectorsp consisting of those polynomials polynom(realvar) for which\n0 \\le polynom(realvar) \\le 1 for all realvar \\in [0,1]; this set is convex and compact. We may then compute the minimal bestconst as the maximum value of \\int_0^1 polynom(realvar)\\,drealvar over all polynom \\in subsetset, provided that the maximum is achieved for some polynomial of degree exactly 3. (Note that any extremal polynomial must satisfy\n\\max_{realvar \\in [0,1]} polynom(realvar) = 1, as otherwise we could multiply it by some constant coeffc>1 so as to increase \\int_0^1 polynom(realvar)\\,drealvar.)\n\nLet funclinear: vectorsp \\to \\RR be the function taking polynom(realvar) to \\int_0^1 polynom(realvar)\\,drealvar. This function is linear, so we can characterize its extrema on subsetset easily: there exist exactly two level surfaces for funclinear which are supporting planes for subsetset, and the intersections of these two planes\nwith subsetset are the minima and the maxima. It is obvious that the unique minimum is achieved by the zero polynomial, so this accounts for one of the planes.\n\nIt thus suffices to exhibit a single polynomial polynom(realvar) \\in subsetset such that the level plane of funclinear through polynom is a supporting plane for subsetset. \nThe calculation made in the solution amounts to verifying that\n\\[\npolynom(realvar) = 4\\,realvar^3 - 8\\,realvar^2 + 5\\,realvar\n\\]\nhas this property, by interpolating between the constraints polynom(1/2) \\le 1 and polynom(1) \\le 1.\n\nThis still leaves the matter of correctly guessing the optimal polynomial. If one supposes that it should be extremized both at realvar=1 and at an interior value of the disc, it is forced to have the form polynom(realvar) = 1 + (realvar-1)(coeffc\\,realvar-1)^2 for some coeffc>0; the interpolation property then pins down coeffc uniquely.\n\n\\noindent\n\\textbf{Second solution:}\n(by James Merryfield, via AoPS)\nAs in the first solution, we may assume that polynom is nonnegative on [0,1] and polynom(0)=0.\nSince polynom has degree at most 3, Simpson's rule for approximating \\int_0^1 polynom(realvar)\\,drealvar is an exact formula:\n\\[\n\\int_0^1 polynom(realvar)\\,drealvar = \\tfrac16\\bigl( polynom(0) + 4\\, polynom\\!\\left( \\tfrac12 \\right) + polynom(1)\\bigr).\n\\]\nThis immediately yields the claimed inequality for bestconst = 5/6. Again as in the first solution,\nwe obtain an example showing that this value is best possible."
    },
    "descriptive_long_confusing": {
      "map": {
        "I_i": "tangerine",
        "P": "pinecone",
        "S": "sailboat",
        "V": "violinist",
        "f": "firehouse",
        "i": "iguanafish",
        "k": "kangaroos",
        "\\ell": "lemonade",
        "x": "xylophone",
        "C": "chocolate",
        "a": "aardvarks",
        "b": "beethoven",
        "c": "coconutty"
      },
      "question": "Find the smallest constant $chocolate$ such that for every real polynomial $pinecone(xylophone)$ of degree 3 that has a root in the interval $[0,1]$,\\[\n\\int_0^1 \\left| pinecone(xylophone) \\right|\\,dx \\leq chocolate \\max_{xylophone \\in [0,1]} \\left| pinecone(xylophone) \\right|.\\]",
      "solution": "We prove that the smallest such value of $chocolate$ is $5/6$.\n\n\\noindent\n\\textbf{First solution:}\n(based on a suggestion of Daniel Kane)\n\nWe first reduce to the case where $pinecone$ is nonnegative in $[0,1]$ and $pinecone(0) = 0$.\nTo achieve this reduction, suppose that a given value $chocolate$ obeys the inequality for such $pinecone$.\nFor $pinecone$ general,\ndivide the interval $[0,1]$ into subintervals $tangerine_1,\\dots,tangerine_{kangaroos}$ at the roots of $pinecone$.\nWrite $lemonade(tangerine_{iguanafish})$ for the length of the interval $tangerine_{iguanafish}$; since each interval is bounded by a root of $pinecone$, we may make a linear change of variable to see that\n\\[\n\\int_{tangerine_{iguanafish}} |pinecone(xylophone)|\\,dx \\leq chocolate \\, lemonade(tangerine_{iguanafish}) \\max_{xylophone \\in tangerine_{iguanafish}} |pinecone(xylophone)| \\quad (\\text{iguanafish}=1,\\dots,kangaroos).\n\\]\nSumming over $\\text{iguanafish}$ yields the desired inequality.\n\nSuppose now that $pinecone$ takes nonnegative values on $[0,1]$, $pinecone(0) = 0$, and $\\max_{xylophone \\in [0,1]} pinecone(xylophone) = 1$. Write $pinecone(xylophone) = aardvarks xylophone^3 + beethoven xylophone^2 + coconutty xylophone$ for some $aardvarks,beethoven,coconutty \\in \\RR$; then\n\\begin{align*}\n\\int_0^1 pinecone(xylophone)\\,dx &= \\frac{1}{4} aardvarks + \\frac{1}{3} beethoven + \\frac{1}{2} coconutty \\\\\n&= \\frac{2}{3} \\left( \\frac{1}{8} aardvarks + \\frac{1}{4} beethoven + \\frac{1}{2} coconutty \\right)\n+ \\frac{1}{6} (aardvarks+beethoven+coconutty) \\\\\n&= \\frac{2}{3} pinecone\\left( \\frac{1}{2} \\right) + \\frac{1}{6} pinecone(1) \\\\\n&\\leq \\frac{2}{3} + \\frac{1}{6} = \\frac{5}{6}.\n\\end{align*}\nConsequently, the originally claimed inequality holds with $chocolate = 5/6$. To prove that this value is best possible, it suffices to exhibit a polynomial $pinecone$ as above with $\\int_0^1 pinecone(xylophone)\\,dx = 5/6$; we will verify that\n\\[\npinecone(xylophone) = 4xylophone^3 - 8xylophone^2 + 5xylophone\n\\]\nhas this property. It is apparent that $\\int_0^1 pinecone(xylophone)\\, dx =5/6$.\nSince $pinecone'(xylophone) = (2xylophone-1)(6xylophone-5)$ and \n\\[\npinecone(0) = 0, \\,pinecone\\left( \\frac{1}{2} \\right) = 1, \\\npinecone\\left( \\frac{5}{6} \\right) = \\frac{25}{27}, pinecone(1) = 1,\n\\]\nit follows that $pinecone$ increases from 0 at $xylophone=0$ to 1 at $xylophone=1/2$, then decreases to a positive value at $xylophone=5/6$, then increases to 1 at $xylophone=1$. Hence $pinecone$ has the desired form.\n\n\\noindent\n\\textbf{Remark:}\nHere is some conceptual motivation for the preceding solution.\nLet $violinist$ be the set of polynomials of degree at most 3 vanishing at 0, viewed as a three-dimensional vector space over $\\RR$.\nLet $sailboat$ be the subset of $violinist$ consisting of those polynomials $pinecone(xylophone)$ for which\n$0 \\leq pinecone(xylophone) \\leq 1$ for all $xylophone \\in [0,1]$; this set is convex and compact. We may then compute the minimal $chocolate$ as the maximum value of $\\int_0^1 pinecone(xylophone)\\,dx$ over all $pinecone \\in sailboat$, provided that the maximum is achieved for some polynomial of degree exactly 3. (Note that any extremal polynomial must satisfy\n$\\max_{xylophone \\in [0,1]} pinecone(xylophone) = 1$, as otherwise we could multiply it by some constant $c>1$ so as to increase $\\int_0^1 pinecone(xylophone)\\,dx$.)\n\nLet $firehouse: violinist \\to \\RR$ be the function taking $pinecone(xylophone)$ to $\\int_0^1 pinecone(xylophone)\\,dx$. This function is linear, so we can characterize its extrema on $sailboat$ easily: there exist exactly two level surfaces for $firehouse$ which are supporting planes for $sailboat$, and the intersections of these two planes\nwith $sailboat$ are the minima and the maxima. It is obvious that the unique minimum is achieved by the zero polynomial, so this accounts for one of the planes.\n\nIt thus suffices to exhibit a single polynomial $pinecone(xylophone) \\in sailboat$ such that the level plane of $firehouse$ through $pinecone$ is a supporting plane for $sailboat$. \nThe calculation made in the solution amounts to verifying that\n\\[\npinecone(xylophone) = 4xylophone^3 - 8xylophone^2 + 5xylophone\n\\]\nhas this property, by interpolating between the constraints $pinecone(1/2) \\leq 1$ and $pinecone(1) \\leq 1$.\n\nThis still leaves the matter of correctly guessing the optimal polynomial. If one supposes that it should be extremized both at $xylophone=1$ and at an interval value of the disc, it is forced to have the form $pinecone(xylophone) = 1 + (xylophone-1)(coconutty xylophone-1)^2$ for some $coconutty>0$; the interpolation property then pins down $coconutty$ uniquely.\n\n\\noindent\n\\textbf{Second solution:}\n(by James Merryfield, via AoPS)\nAs in the first solution, we may assume that $pinecone$ is nonnegative on $[0,1]$ and $pinecone(0)= 0$.\nSince $pinecone$ has degree at most 3, Simpson's rule for approximating $\\int_0^1 pinecone(xylophone)\\,dx$ is an exact formula:\n\\[\n\\int_0^1 pinecone(xylophone)\\,dx = \\frac{1}{6}( pinecone(0) + 4 pinecone\\left( \\frac{1}{2} \\right) + pinecone(1)).\n\\]\nThis immediately yields the claimed inequality for $chocolate = 5/6$. Again as in the first solution,\nwe obtain an example showing that this value is best possible."
    },
    "descriptive_long_misleading": {
      "map": {
        "I_i": "singularity",
        "P": "constantpoly",
        "S": "nonconvex",
        "V": "scalarplace",
        "f": "nonlinear",
        "i": "ultimatenum",
        "k": "primarynum",
        "\\ell": "thickness",
        "x": "knownvalue",
        "C": "variablefactor",
        "a": "randomizer",
        "b": "arbitrariness",
        "c": "aftereffect"
      },
      "question": "Find the smallest constant $variablefactor$ such that for every real polynomial $constantpoly(knownvalue)$ of degree 3 that has a root in the interval $[0,1]$,\\[\n\\int_0^1 \\left| constantpoly(knownvalue) \\right|\\,d knownvalue \\leq variablefactor \\max_{knownvalue \\in [0,1]} \\left| constantpoly(knownvalue) \\right|.\n\\]",
      "solution": "We prove that the smallest such value of $variablefactor$ is $5/6$.\n\n\\noindent\n\\textbf{First solution:}\n(based on a suggestion of Daniel Kane)\n\nWe first reduce to the case where $constantpoly$ is nonnegative in $[0,1]$ and $constantpoly(0) = 0$.\nTo achieve this reduction, suppose that a given value $variablefactor$ obeys the inequality for such $constantpoly$.\nFor $constantpoly$ general,\ndivide the interval $[0,1]$ into subintervals $I_1,\\dots,I_{primarynum}$ at the roots of $constantpoly$.\nWrite $thickness(singularity_{ultimatenum})$ for the length of the interval $singularity_{ultimatenum}$; since each interval is bounded by a root of $constantpoly$, we may make a linear change of variable to see that\n\\[\n\\int_{singularity_{ultimatenum}} |constantpoly(knownvalue)|\\,d knownvalue \\leq variablefactor\\, thickness(singularity_{ultimatenum}) \\max_{knownvalue \\in singularity_{ultimatenum}} |constantpoly(knownvalue)| \\quad (ultimatenum=1,\\dots,primarynum).\n\\]\nSumming over $ultimatenum$ yields the desired inequality.\n\nSuppose now that $constantpoly$ takes nonnegative values on $[0,1]$, $constantpoly(0) = 0$, and $\\max_{knownvalue \\in [0,1]} constantpoly(knownvalue) = 1$. Write $constantpoly(knownvalue) = randomizer knownvalue^3 + arbitrariness knownvalue^2 + aftereffect knownvalue$ for some $randomizer,arbitrariness,aftereffect \\in \\RR$; then\n\\begin{align*}\n\\int_0^1 constantpoly(knownvalue)\\,d knownvalue &= \\frac{1}{4} randomizer + \\frac{1}{3} arbitrariness + \\frac{1}{2} aftereffect \\\\\n&= \\frac{2}{3} \\left( \\frac{1}{8} randomizer + \\frac{1}{4} arbitrariness + \\frac{1}{2} aftereffect \\right)\n+ \\frac{1}{6} (randomizer+arbitrariness+aftereffect) \\\\\n&= \\frac{2}{3} constantpoly\\left( \\frac{1}{2} \\right) + \\frac{1}{6} constantpoly(1) \\\\\n&\\leq \\frac{2}{3} + \\frac{1}{6} = \\frac{5}{6}.\n\\end{align*}\nConsequently, the originally claimed inequality holds with $variablefactor = 5/6$. To prove that this value is best possible, it suffices to exhibit a polynomial $constantpoly$ as above with $\\int_0^1 constantpoly(knownvalue)\\,d knownvalue = 5/6$; we will verify that\n\\[\nconstantpoly(knownvalue) = 4 knownvalue^3 - 8 knownvalue^2 + 5 knownvalue\n\\]\nhas this property. It is apparent that $\\int_0^1 constantpoly(knownvalue)\\, d knownvalue =5/6$.\nSince $constantpoly'(knownvalue) = (2 knownvalue-1)(6 knownvalue-5)$ and \n\\[\nconstantpoly(0) = 0, \\,constantpoly\\left( \\frac{1}{2} \\right) = 1, \\,\nconstantpoly\\left( \\frac{5}{6} \\right) = \\frac{25}{27}, constantpoly(1) = 1,\n\\]\nit follows that $constantpoly$ increases from 0 at $knownvalue=0$ to 1 at $knownvalue=1/2$, then decreases to a positive value at $knownvalue=5/6$, then increases to 1 at $knownvalue=1$. Hence $constantpoly$ has the desired form.\n\n\\noindent\n\\textbf{Remark:}\nHere is some conceptual motivation for the preceding solution.\nLet $scalarplace$ be the set of polynomials of degree at most 3 vanishing at 0, viewed as a three-dimensional vector space over $\\RR$.\nLet $nonconvex$ be the subset of $scalarplace$ consisting of those polynomials $constantpoly(knownvalue)$ for which\n$0 \\leq constantpoly(knownvalue) \\leq 1$ for all $knownvalue \\in [0,1]$; this set is convex and compact. We may then compute the minimal $variablefactor$ as the maximum value of $\\int_0^1 constantpoly(knownvalue)\\,d knownvalue$ over all $constantpoly \\in nonconvex$, provided that the maximum is achieved for some polynomial of degree exactly 3. (Note that any extremal polynomial must satisfy\n$\\max_{knownvalue \\in [0,1]} constantpoly(knownvalue) = 1$, as otherwise we could multiply it by some constant $aftereffect>1$ so as to increase $\\int_0^1 constantpoly(knownvalue)\\,d knownvalue$.)\n\nLet $nonlinear: scalarplace \\to \\RR$ be the function taking $constantpoly(knownvalue)$ to $\\int_0^1 constantpoly(knownvalue)\\,d knownvalue$. This function is linear, so we can characterize its extrema on $nonconvex$ easily: there exist exactly two level surfaces for $nonlinear$ which are supporting planes for $nonconvex$, and the intersections of these two planes\nwith $nonconvex$ are the minima and the maxima. It is obvious that the unique minimum is achieved by the zero polynomial, so this accounts for one of the planes.\n\nIt thus suffices to exhibit a single polynomial $constantpoly(knownvalue) \\in nonconvex$ such that the level plane of $nonlinear$ through $constantpoly$ is a supporting plane for $nonconvex$. \nThe calculation made in the solution amounts to verifying that\n\\[\nconstantpoly(knownvalue) = 4 knownvalue^3 - 8 knownvalue^2 + 5 knownvalue\n\\]\nhas this property, by interpolating between the constraints $constantpoly(1/2) \\leq 1$ and $constantpoly(1) \\leq 1$.\n\nThis still leaves the matter of correctly guessing the optimal polynomial. If one supposes that it should be extremized both at $knownvalue=1$ and at an interval value of the disc, it is forced to have the form $constantpoly(knownvalue) = 1 + (knownvalue-1)(aftereffect knownvalue-1)^2$ for some $aftereffect>0$; the interpolation property then pins down $aftereffect$ uniquely.\n\n\\noindent\n\\textbf{Second solution:}\n(by James Merryfield, via AoPS)\nAs in the first solution, we may assume that $constantpoly$ is nonnegative on $[0,1]$ and $constantpoly(0)= 0$.\nSince $constantpoly$ has degree at most 3, Simpson's rule for approximating $\\int_0^1 constantpoly(knownvalue)\\,d knownvalue$ is an exact formula:\n\\[\n\\int_0^1 constantpoly(knownvalue)\\,d knownvalue = \\frac{1}{6}( constantpoly(0) + 4 constantpoly\\left( \\frac{1}{2} \\right) + constantpoly(1)).\n\\]\nThis immediately yields the claimed inequality for $variablefactor = 5/6$. Again as in the first solution,\nwe obtain an example showing that this value is best possible."
    },
    "garbled_string": {
      "map": {
        "I_i": "jbdswqnk",
        "P": "vhsdqlmc",
        "S": "rklgfjwe",
        "V": "qpnxtrmj",
        "f": "mzkvdhpl",
        "i": "snbjqkwe",
        "k": "rgwzpmft",
        "\\ell": "\\twkshdva",
        "x": "hmfqzplk",
        "C": "cznbvthr",
        "a": "lcjwhqsp",
        "b": "qmskrdvn",
        "c": "bgpwnslh"
      },
      "question": "Find the smallest constant cznbvthr such that for every real polynomial vhsdqlmc(hmfqzplk) of degree 3 that has a root in the interval $[0,1]$,\\n\\[\\n\\int_0^1 \\left| vhsdqlmc(hmfqzplk) \\right|\\,d hmfqzplk \\leq cznbvthr \\max_{hmfqzplk \\in [0,1]} \\left| vhsdqlmc(hmfqzplk) \\right|.\\n\\]",
      "solution": "We prove that the smallest such value of cznbvthr is $5/6$.\\n\\n\\noindent\\n\\textbf{First solution:}\\n(based on a suggestion of Daniel Kane)\\n\\nWe first reduce to the case where vhsdqlmc is nonnegative in $[0,1]$ and vhsdqlmc(0) = 0.\\nTo achieve this reduction, suppose that a given value cznbvthr obeys the inequality for such vhsdqlmc.\\nFor vhsdqlmc general,\\ndivide the interval $[0,1]$ into subintervals jbdswqnk$_1,\\dots,$jbdswqnk$_{rgwzpmft}$ at the roots of vhsdqlmc.\\nWrite $\\twkshdva($jbdswqnk$_{snbjqkwe})$ for the length of the interval jbdswqnk$_{snbjqkwe}$; since each interval is bounded by a root of vhsdqlmc, we may make a linear change of variable to see that\\n\\[\\n\\int_{\\text{jbdswqnk}_{\\text{snbjqkwe}}} |vhsdqlmc(hmfqzplk)|\\,d hmfqzplk \\leq cznbvthr \\, \\twkshdva(\\text{jbdswqnk}_{\\text{snbjqkwe}}) \\max_{hmfqzplk \\in \\text{jbdswqnk}_{\\text{snbjqkwe}}} |vhsdqlmc(hmfqzplk)| \\quad (\\text{snbjqkwe}=1,\\dots,rgwzpmft).\\n\\]\\nSumming over snbjqkwe yields the desired inequality.\\n\\nSuppose now that vhsdqlmc takes nonnegative values on $[0,1]$, vhsdqlmc(0) = 0, and $\\max_{hmfqzplk \\in [0,1]} vhsdqlmc(hmfqzplk) = 1$. Write $vhsdqlmc(hmfqzplk) = lcjwhqsp hmfqzplk^3 + qmskrdvn hmfqzplk^2 + bgpwnslh hmfqzplk$ for some $lcjwhqsp,qmskrdvn,bgpwnslh \\in \\RR$; then\\n\\begin{align*}\\n\\int_0^1 vhsdqlmc(hmfqzplk)\\,d hmfqzplk &= \\frac{1}{4} lcjwhqsp + \\frac{1}{3} qmskrdvn + \\frac{1}{2} bgpwnslh \\\\n&= \\frac{2}{3} \\left( \\frac{1}{8} lcjwhqsp + \\frac{1}{4} qmskrdvn + \\frac{1}{2} bgpwnslh \\right)\\n+ \\frac{1}{6} (lcjwhqsp+qmskrdvn+bgpwnslh) \\\\n&= \\frac{2}{3} vhsdqlmc\\left( \\frac{1}{2} \\right) + \\frac{1}{6} vhsdqlmc(1) \\\\n&\\leq \\frac{2}{3} + \\frac{1}{6} = \\frac{5}{6}.\\n\\end{align*}\\nConsequently, the originally claimed inequality holds with cznbvthr = $5/6$. To prove that this value is best possible, it suffices to exhibit a polynomial vhsdqlmc as above with $\\int_0^1 vhsdqlmc(hmfqzplk)\\,d hmfqzplk = 5/6$; we will verify that\\n\\[\\nvhsdqlmc(hmfqzplk) = 4 hmfqzplk^3 - 8 hmfqzplk^2 + 5 hmfqzplk\\n\\]\\nhas this property. It is apparent that $\\int_0^1 vhsdqlmc(hmfqzplk)\\, d hmfqzplk =5/6$.\\nSince $vhsdqlmc'(hmfqzplk) = (2 hmfqzplk-1)(6 hmfqzplk-5)$ and \\n\\[\\nvhsdqlmc(0) = 0, \\,vhsdqlmc\\left( \\frac{1}{2} \\right) = 1, \\,\\nvhsdqlmc\\left( \\frac{5}{6} \\right) = \\frac{25}{27}, vhsdqlmc(1) = 1,\\n\\]\\nit follows that vhsdqlmc increases from 0 at $hmfqzplk=0$ to 1 at $hmfqzplk=1/2$, then decreases to a positive value at $hmfqzplk=5/6$, then increases to 1 at $hmfqzplk=1$. Hence vhsdqlmc has the desired form.\\n\\n\\noindent\\n\\textbf{Remark:}\\nHere is some conceptual motivation for the preceding solution.\\nLet qpnxtrmj be the set of polynomials of degree at most 3 vanishing at 0, viewed as a three-dimensional vector space over $\\RR$.\\nLet rklgfjwe be the subset of qpnxtrmj consisting of those polynomials vhsdqlmc(hmfqzplk) for which\\n$0 \\leq vhsdqlmc(hmfqzplk) \\leq 1$ for all $hmfqzplk \\in [0,1]$; this set is convex and compact. We may then compute the minimal cznbvthr as the maximum value of $\\int_0^1 vhsdqlmc(hmfqzplk)\\,d hmfqzplk$ over all $vhsdqlmc \\in$ rklgfjwe, provided that the maximum is achieved for some polynomial of degree exactly 3. (Note that any extremal polynomial must satisfy\\n$\\max_{hmfqzplk \\in [0,1]} vhsdqlmc(hmfqzplk) = 1$, as otherwise we could multiply it by some constant bgpwnslh>1 so as to increase $\\int_0^1 vhsdqlmc(hmfqzplk)\\,d hmfqzplk$.)\\n\\nLet mzkvdhpl: qpnxtrmj $\\to \\RR$ be the function taking vhsdqlmc(hmfqzplk) to $\\int_0^1 vhsdqlmc(hmfqzplk)\\,d hmfqzplk$. This function is linear, so we can characterize its extrema on rklgfjwe easily: there exist exactly two level surfaces for mzkvdhpl which are supporting planes for rklgfjwe, and the intersections of these two planes\\nwith rklgfjwe are the minima and the maxima. It is obvious that the unique minimum is achieved by the zero polynomial, so this accounts for one of the planes.\\n\\nIt thus suffices to exhibit a single polynomial vhsdqlmc(hmfqzplk) $\\in$ rklgfjwe such that the level plane of mzkvdhpl through vhsdqlmc is a supporting plane for rklgfjwe. \\nThe calculation made in the solution amounts to verifying that\\n\\[\\nvhsdqlmc(hmfqzplk) = 4 hmfqzplk^3 - 8 hmfqzplk^2 + 5 hmfqzplk\\n\\]\\nhas this property, by interpolating between the constraints vhsdqlmc(1/2) $\\leq 1$ and vhsdqlmc(1) $\\leq 1$.\\n\\nThis still leaves the matter of correctly guessing the optimal polynomial. If one supposes that it should be extremized both at $hmfqzplk=1$ and at an interval value of the disc, it is forced to have the form $vhsdqlmc(hmfqzplk) = 1 + (hmfqzplk-1)(bgpwnslh hmfqzplk-1)^2$ for some bgpwnslh>0; the interpolation property then pins down bgpwnslh uniquely.\\n\\n\\noindent\\n\\textbf{Second solution:}\\n(by James Merryfield, via AoPS)\\nAs in the first solution, we may assume that vhsdqlmc is nonnegative on $[0,1]$ and vhsdqlmc(0)= 0.\\nSince vhsdqlmc has degree at most 3, Simpson's rule for approximating $\\int_0^1 vhsdqlmc(hmfqzplk)\\,d hmfqzplk$ is an exact formula:\\n\\[\\n\\int_0^1 vhsdqlmc(hmfqzplk)\\,d hmfqzplk = \\frac{1}{6}( vhsdqlmc(0) + 4 vhsdqlmc\\left( \\frac{1}{2} \\right) + vhsdqlmc(1)).\\n\\]\\nThis immediately yields the claimed inequality for cznbvthr = 5/6. Again as in the first solution,\\nwe obtain an example showing that this value is best possible."
    },
    "kernel_variant": {
      "question": "Let C be the least real number for which the following statement holds:\n\nFor every real polynomial P(x) of degree at most 3 that possesses at least one real root in the interval [−1,0],\n\na) the integral of its absolute value satisfies\n   ∫_{−1}^{0} |P(x)| dx ≤ C · max_{x∈[−1,0]} |P(x)| .\n\nDetermine the value of C.",
      "solution": "Answer.  C = 5/6.\n\n----------------------------------------------------------------------------\nProof.\n\n1.  Reduction to sub-intervals on which P keeps one sign.\n\nLet the (real) roots of P in [−1,0] – plus the two endpoints if they are not already roots – be\n −1 = ξ₀ < ξ₁ < … < ξ_m = 0 .\nOn each open sub-interval I_j = (ξ_{j−1}, ξ_j) (j = 1,…,m) the polynomial does not change sign, so |P| = ±P there.  Close each I_j to\n I_j   :=  [ξ_{j−1}, ξ_j] .\nBecause |P| is integrable and equal to |P| on each I_j, we have\n   ∫_{−1}^{0} |P| dx  =  Σ_{j=1}^{m} ∫_{I_j} |P| dx .   (1)\nWe will bound each summand.\n\n2.  Affine rescaling of a single sub-interval.\n\nFix an index j and write I = [a,b] for I_j  (so a = ξ_{j−1}, b = ξ_j).  At least one endpoint of I is a root; denote it by ρ.  There are two cases.\n\n Case A.  ρ = a  (left endpoint is a root).\n  Set   t = (x − a)/(b − a) − 1,    so x = a  ⇔  t = −1  and  x = b  ⇔  t = 0.\n  Then dx = (b − a) dt with (b − a) > 0.\n\n Case B.  ρ = b  (right endpoint is a root).\n  Set   t = (x − b)/(a − b) − 1,    so again x = ρ ⇒ t = −1 and the other endpoint ⇒ t = 0.\n  Now dx = (a − b) dt with (a − b) < 0, but since the substitution reverses orientation, the\n  limits  t = −1 → 0 produce a positive contribution; in formulas\n   ∫_{I} |P(x)| dx = (b − a) ∫_{−1}^{0} |P(x(t))| dt     (because |b − a| = b − a ≥ 0).\n\nIn both cases the change of variable may therefore be written uniformly as\n   ∫_{I} |P(x)| dx = (b − a) ∫_{−1}^{0} |P(x(t))| dt ,        (2)\nwhere t ↦ x(t) is a linear map and x(−1)=ρ is a root of P.\n\n3.  Normalisation of the maximum.\n\nPut   M_I := max_{x∈I} |P(x)| .  Define\n   R(t) := |P(x(t))| / M_I .\nThen\n   (i)  R is a real polynomial in t of degree ≤ 3;\n   (ii) R(t) ≥ 0 on [−1,0];\n   (iii) R(−1) = 0  (because x(−1)=ρ is a root of P);\n   (iv) max_{t∈[−1,0]} R(t) = 1.\n\n4.  Simpson’s rule on [−1,0].\n\nBecause R is a cubic (or of lower degree), Simpson’s rule is exact:\n   ∫_{−1}^{0} R(t)\n         dt = 1/6 · ( R(−1) + 4 R(−½) + R(0) )            (3)\n≤ 1/6 · ( 0 + 4·1 + 1 )\n= 5/6 .\n\n5.  The bound on a single sub-interval.\n\nCombine (2), the definition of R, and (3):\n   ∫_{I} |P(x)| dx  =  (b − a) M_I ∫_{−1}^{0} R(t) dt\n                   ≤ (b − a) M_I (5/6).                     (4)\n\n6.  Summation over all sub-intervals.\n\nSum (4) over j = 1,…,m and use (1):\n   ∫_{−1}^{0} |P(x)| dx  ≤  (5/6) · max_{1≤j≤m} M_{I_j} · Σ_{j=1}^{m} (b − a)\n                         =  (5/6) · max_{x∈[−1,0]} |P(x)| · 1 ,\nbecause the lengths of the I_j add up to the total length of [−1,0], namely 1.  Hence the inequality of the problem holds with C = 5/6.\n\n7.  Sharpness of the constant.\n\nConsider\n   Q(x) = 8x³ + 8x² + 2x + 2     (degree 3).\nOn [−1,0] we have Q(−1) = 0,   Q(−½) = Q(0) = 2, so max_{[−1,0]} Q = 2.\nBy Simpson’s rule (again exact for cubics)\n   ∫_{−1}^{0} Q(x) dx = 1/6 · ( Q(−1) + 4 Q(−½) + Q(0) )\n                      = 1/6 · ( 0 + 4·2 + 2 ) = 5/3.\nThus\n   ∫_{−1}^{0} |Q(x)| dx = 5/3 = (5/6) · 2 = (5/6) · max_{[−1,0]} |Q(x)| .\nNo smaller constant can therefore work, so the optimal value is indeed C = 5/6.\n\n----------------------------------------------------------------------------\nComment on exactness of Simpson’s rule.\nFor any polynomial R of degree ≤ 3 one has\n ∫_{−1}^{0} R(t) dt = 1/6 ( R(−1) + 4 R(−½) + R(0) ),\nwhich may be verified by checking monomials 1, t, t², t³.\n\nThe proof is complete.",
      "_meta": {
        "core_steps": [
          "Split [0,1] at the roots and rescale each piece; hence it suffices to study a non-negative cubic with P(0)=0 and max_{[0,1]} P = 1.",
          "Use the fact that Simpson’s rule is exact for cubics:  ∫₀¹ P = (1/6)(P(0)+4P(1/2)+P(1)).",
          "Insert the bounds P(0)=0, P(1/2)≤1, P(1)≤1 to get ∫₀¹ P ≤ 5/6.",
          "Conclude that C=5/6 satisfies the required inequality.",
          "Exhibit a cubic attaining equality to prove the value is best possible."
        ],
        "mutable_slots": {
          "slot1": {
            "description": "Choice of which root is shifted to the left endpoint before the analysis begins.",
            "original": "P(0)=0"
          },
          "slot2": {
            "description": "Scale used to normalise the supremum of P on the interval.",
            "original": "max_{x∈[0,1]} P(x)=1"
          },
          "slot3": {
            "description": "Concrete extremal cubic displayed to show sharpness; any other cubic with the same extremal properties would do.",
            "original": "4x^3 − 8x^2 + 5x"
          },
          "slot4": {
            "description": "Exact placement of the unit-length interval (a translation to [a,a+1] leaves the argument intact after a change of variables).",
            "original": "[0,1]"
          }
        }
      }
    }
  },
  "checked": true,
  "problem_type": "calculation",
  "iteratively_fixed": true
}