{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "HC3BQBQECH"
    }
  ],
  "body": "\n## Summary\n\nA Boolean matrix, also called a logical matrix or a $(0,1)$-matrix, is a [[matrix|0VD9ZSWWJG]] whose entries are $0$ and $1$, read as false and true.\nIt records a [[binary relation|05AVARPXA2]] between two finite sets.\nWith Boolean arithmetic, the product of two such matrices records the [[composition of the relations|0PYSR20HGF]].\nThe [[adjacency matrix|08B9CX109G]] of a [[directed graph|0KFYGSHHF5]] is the main example.\n\n## Explanations\n\n### L1 human\n\nWrite the elements of one set along the rows and the elements of another set along the columns.\nPut a $1$ in a cell when the row element is related to the column element, and a $0$ otherwise.\nFor the relation \"divides\" on $\\set{1, 2, 3}$, the first row is $1, 1, 1$, because $1$ divides every number.\nThe second row is $0, 1, 0$ and the third row is $0, 0, 1$.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "15B34",
      "05C50"
    ],
    "name": "Boolean matrix",
    "same_as": {
      "wikidata": "Q1994977",
      "wikipedia": "Logical matrix"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Logical_matrix"
      }
    ],
    "tag": "AS4WVMYEDZ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/AS4WVMYEDZ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/AS4WVMYEDZ.md",
  "msc": [
    "15B34",
    "05C50"
  ],
  "name": "Boolean matrix",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/AS4/AS4WVMYEDZ.md",
  "status": null,
  "tag": "AS4WVMYEDZ",
  "uri": "m2://AS4WVMYEDZ",
  "url": "https://math2.tamnd.com/wiki/boolean-matrix/",
  "writing": {
    "tag": "AS4WVMYEDZ",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}
