{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $a = (a_1, \\dots, a_n)$ and $b = (b_1, \\dots, b_n)$ be vectors of nonnegative real numbers.\nFor $x_1, \\dots, x_n \u003e 0$, write\n$$[a](x) = \\frac{1}{n!} \\sum_{\\sigma \\in S_n} x_{\\sigma(1)}^{a_1} x_{\\sigma(2)}^{a_2} \\cdots x_{\\sigma(n)}^{a_n},$$\nwhere $S_n$ is the set of [[permutations|0BQMWCNS8S]] of $\\set{1, \\dots, n}$.\nThen $[b](x) \\le [a](x)$ for all $x_1, \\dots, x_n \u003e 0$ if and only if $a$ [[majorizes|5K7VT2VKZT]] $b$.\n\n## Remarks\n\nProof idea: suppose $a$ majorizes $b$.\nThen $b$ can be reached from $a$ by finitely many steps, each of which moves two entries closer together while keeping their sum.\nFor one such step it suffices to compare two variables, where the claim reduces to $x^{s} y^{t} + x^{t} y^{s} \\ge x^{s'} y^{t'} + x^{t'} y^{s'}$ for $s + t = s' + t'$ and $\\abs{s - t} \\ge \\abs{s' - t'}$, which follows by factoring.\nConversely, letting all $x_i$ but some tend to $0$ or $\\infty$ shows that the partial sum conditions of majorization are needed.\n\nExample: $a = (2, 0)$ majorizes $b = (1, 1)$, which gives $\\frac{1}{2}(x^2 + y^2) \\ge x y$.\nWith $a = (n, 0, \\dots, 0)$ and $b = (1, 1, \\dots, 1)$ one gets $\\frac{1}{n}\\sum_i x_i^n \\ge x_1 x_2 \\cdots x_n$, the [[AM–GM inequality|0DRF0F3XC9]] for $x_1^n, \\dots, x_n^n$.\n\n## Explanations\n\n### L1 human\n\nMuirhead's inequality compares symmetric sums of monomials in positive numbers.\nEach such sum is labelled by its exponent vector.\nThe sum whose exponents are more spread out is never the smaller one, and this order is exactly majorization.\n\n### L2 human\n\nMuirhead's inequality settles many symmetric polynomial inequalities at once, and it is a standard tool in olympiad problems.\nTo use it, write both sides as combinations of symmetric sums $[a]$ and check majorization of the exponent vectors.\nIt does not apply directly when the two sides have different total degree, or when some coefficients are negative; then one combines it with other tools such as [[Schur's inequality|958TMJZ51Y]].\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "about": [
      "5K7VT2VKZT"
    ],
    "kind": "statement",
    "msc": [
      "26D15",
      "05E05"
    ],
    "name": "Muirhead's inequality",
    "role": "theorem",
    "same_as": {
      "wikidata": "Q930173",
      "wikipedia": "Muirhead's inequality"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Muirhead%27s_inequality"
      }
    ],
    "tag": "PBPFVY20WT",
    "uses": [
      "5K7VT2VKZT",
      "0BQMWCNS8S"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/PBPFVY20WT/",
  "links": [
    {
      "field": "about",
      "target": "5K7VT2VKZT"
    },
    {
      "field": "uses",
      "target": "5K7VT2VKZT"
    },
    {
      "field": "uses",
      "target": "0BQMWCNS8S"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/PBPFVY20WT.md",
  "msc": [
    "26D15",
    "05E05"
  ],
  "name": "Muirhead's inequality",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PBP/PBPFVY20WT.md",
  "status": null,
  "tag": "PBPFVY20WT",
  "uri": "m2://PBPFVY20WT",
  "url": "https://math2.tamnd.com/wiki/muirheads-inequality/",
  "writing": {
    "tag": "PBPFVY20WT",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}