{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "02BPKD7TMD"
    },
    {
      "field": "uses",
      "target": "02SJG1HC32"
    },
    {
      "field": "uses",
      "target": "0AWMPX35CW"
    },
    {
      "field": "uses",
      "target": "0CBRFQ7DVZ"
    },
    {
      "field": "uses",
      "target": "0KWWEXW0RN"
    },
    {
      "field": "uses",
      "target": "0M893X7YY7"
    },
    {
      "field": "uses",
      "target": "0NFEG48RDR"
    },
    {
      "field": "uses",
      "target": "0QFV5Y1Z5X"
    },
    {
      "field": "uses",
      "target": "0SK1VHZ5R2"
    },
    {
      "field": "uses",
      "target": "0VG02M1FEZ"
    },
    {
      "field": "uses",
      "target": "0VNE161QCK"
    }
  ],
  "body": "\n## Definition\n\nLet $R$ be an [[integral domain|09S3PFBEPM]].\nA polynomial $f \\in R[x]$ is irreducible over $R$ if it is an [[irreducible element|052SDEPZH7]] of the integral domain $R[x]$.\nThat is, $f$ is nonzero and not a unit, and if $f = g h$ with $g, h \\in R[x]$, then $g$ or $h$ is a unit of $R[x]$.\n\n## Remarks\n\nOver a [[field|0QA8CHH8MG]] $K$, the units of $K[x]$ are the nonzero constants. So $f$ is irreducible if and only if $\\deg f \\ge 1$ and $f$ is not a product of two polynomials of smaller degree.\nThe polynomial $x^2 - 2$ is irreducible over $\\mathbb{Q}$ but not over $\\mathbb{R}$, where $x^2 - 2 = (x - \\sqrt{2})(x + \\sqrt{2})$.\nThe polynomial $x^2 + 1$ is irreducible over $\\mathbb{R}$ but not over $\\mathbb{C}$.\nOver $\\mathbb{Z}$, the polynomial $2x + 2 = 2(x + 1)$ is not irreducible, because $2$ is not a unit of $\\mathbb{Z}[x]$.\n\n## Explanations\n\n### L1 human\n\nIrreducible polynomials are the prime numbers of polynomial rings.\nOver a field, they are the polynomials that you cannot factor into polynomials of smaller degree.\nIrreducibility depends on the field: $x^2 + 1$ factors over $\\mathbb{C}$ but not over $\\mathbb{R}$.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "03FKX7Z5DC",
    "kind": "definition",
    "msc": [
      "12E05"
    ],
    "name": "Irreducible polynomial",
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Irreducible_polynomial"
      }
    ],
    "tag": "00X2A9G9W3",
    "uses": [
      "052SDEPZH7",
      "0Q9EZS90GY"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/00X2A9G9W3/",
  "links": [
    {
      "field": "defines",
      "target": "03FKX7Z5DC"
    },
    {
      "field": "uses",
      "target": "052SDEPZH7"
    },
    {
      "field": "uses",
      "target": "0Q9EZS90GY"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/00X2A9G9W3.md",
  "msc": [
    "12E05"
  ],
  "name": "Irreducible polynomial",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/00X/00X2A9G9W3.md",
  "status": null,
  "tag": "00X2A9G9W3",
  "uri": "m2://00X2A9G9W3",
  "url": "https://math2.tamnd.com/wiki/irreducible-polynomial-definition/",
  "writing": {
    "tag": "00X2A9G9W3",
    "kind": "definition",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "one example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge not_instance_of in",
        "note": "one non-example that fails one clause",
        "have": 0,
        "want": 1
      }
    ]
  }
}