{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Definition\n\nLet $V$ be an inner product space over $\\R$ or $\\C$, and let $v_1, \\dots, v_k \\in V$.\nThe *Gram matrix* of $v_1, \\dots, v_k$ is the $k \\times k$ matrix $G$ with entries\n$$G_{ij} = \\langle v_i, v_j \\rangle \\qquad (1 \\le i, j \\le k),$$\nwhere $\\langle \\cdot, \\cdot \\rangle$ is the [[inner product|0NB0AWGJBW]].\n\n## Remarks\n\nThe Gram matrix is Hermitian and [[positive semidefinite|01MMVW8CKC]].\nIt is invertible if and only if $v_1, \\dots, v_k$ are linearly independent.\nFor real column vectors $v_i \\in \\R^n$ with the dot product, $G = A^T A$, where $A$ has the columns $v_1, \\dots, v_k$.\nIts determinant is the square of the $k$-dimensional volume of the parallelepiped spanned by the $v_i$.\n\n## Explanations\n\n### L1 human\n\nThe Gram matrix records all inner products of a list of vectors.\nIt contains all lengths and all angles between them.\nTwo lists with the same Gram matrix have the same shape, up to an isometry.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "00SPJSDT3Z",
    "kind": "definition",
    "msc": [
      "15A63",
      "15B57"
    ],
    "name": "Gram matrix",
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Gram_matrix"
      }
    ],
    "tag": "0HX8HZ1WTQ",
    "uses": [
      "0VGSYBWHV2"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0HX8HZ1WTQ/",
  "links": [
    {
      "field": "defines",
      "target": "00SPJSDT3Z"
    },
    {
      "field": "uses",
      "target": "0VGSYBWHV2"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0HX8HZ1WTQ.md",
  "msc": [
    "15A63",
    "15B57"
  ],
  "name": "Gram matrix",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0HX/0HX8HZ1WTQ.md",
  "status": null,
  "tag": "0HX8HZ1WTQ",
  "uri": "m2://0HX8HZ1WTQ",
  "url": "https://math2.tamnd.com/wiki/gram-matrix-definition/",
  "writing": {
    "tag": "0HX8HZ1WTQ",
    "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
      }
    ]
  }
}
