{
  "id": "reflexive-relation",
  "title": "Reflexive Relation",
  "lang": "en",
  "source_lang": "en",
  "summary": "A reflexive relation is a binary relation on a set in which every element is related to itself.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Reflexive binary relation"
  ],
  "generated_at": "2026-11-06",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/reflexive-relation/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/reflexive-relation/",
      "json": "https://aiwiki.page/zh/reflexive-relation.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A reflexive relation is a binary relation on a set in which every element is related to itself. Formally, a relation \\(R\\subseteq A\\times A\\) is reflexive on \\(A\\) if\n\n\\[\\forall a\\in A,\\quad (a,a)\\in R.\\]\n\nReflexivity is one of the defining properties of equivalence relations and partial orders. It imposes a requirement only on pairs whose two entries are equal; it places no restriction on whether distinct elements are related."
    },
    {
      "heading": "Definition and underlying set",
      "text": "Writing \\(aRb\\) for \\((a,b)\\in R\\), the defining condition becomes\n\n\\[\\forall a\\in A,\\quad aRa.\\]\n\nThe relation \\(R\\) is a subset of the Cartesian product \\(A\\times A\\).\n\nThe identity relation, or diagonal relation, on \\(A\\) is\n\n\\[\\Delta_A=\\{(a,a):a\\in A\\}.\\]\n\nThus reflexivity can equivalently be expressed as\n\n\\[\\Delta_A\\subseteq R.\\]\n\nThe identity relation is the smallest reflexive relation on \\(A\\), while the universal relation \\(A\\times A\\) is the largest.\n\nReflexivity depends on the specified underlying set. For example,\n\n\\[R=\\{(1,1),(2,2)\\}\\]\n\nis reflexive on \\(\\{1,2\\}\\), but not on \\(\\{1,2,3\\}\\), because \\((3,3)\\notin R\\).\n\nOn the empty set, the empty relation is reflexive: there is no element for which the requirement could fail. This is an instance of a universally quantified statement being true when its domain is empty."
    },
    {
      "heading": "Examples and nonexamples",
      "text": "Common reflexive relations include:\n\n- Equality: \\(a=a\\) for every element of any set.\n- Non-strict numerical order: \\(a\\leq a\\) for every real number \\(a\\).\n- Set inclusion: \\(B\\subseteq B\\) for every set \\(B\\), so inclusion is reflexive on any specified collection of sets.\n- Divisibility: Every positive integer divides itself.\n- Congruence modulo a positive integer: \\(a\\equiv a\\pmod m\\), since \\(m\\) divides \\(a-a=0\\). This relation is central to modular arithmetic.\n\nIn contrast, strict order \\(<\\) is not reflexive on a nonempty set of numbers, because \\(a<a\\) never holds. Inequality \\(\\neq\\) likewise never relates an element to itself.\n\nReflexivity does not require every pair to belong to the relation. On \\(A=\\{1,2\\}\\), the relation\n\n\\[R=\\{(1,1),(2,2),(1,2)\\}\\]\n\nis reflexive even though \\((2,1)\\notin R\\)."
    },
    {
      "heading": "Distinction from other relation properties",
      "text": "A relation is irreflexive if no element is related to itself:\n\n\\[\\forall a\\in A,\\quad (a,a)\\notin R.\\]\n\nBeing not reflexive is different from being irreflexive. Failure of reflexivity requires only one missing diagonal pair:\n\n\\[\\exists a\\in A,\\quad (a,a)\\notin R.\\]\n\nFor example, \\(\\{(1,1)\\}\\) on \\(\\{1,2\\}\\) is neither reflexive nor irreflexive. On a nonempty set, a relation cannot be both reflexive and irreflexive; on the empty set, the empty relation has both properties.\n\nReflexivity is also distinct from:\n\n- Symmetry: \\(aRb\\) implies \\(bRa\\).\n- Antisymmetry: \\(aRb\\) and \\(bRa\\) together imply \\(a=b\\).\n- Transitivity: \\(aRb\\) and \\(bRc\\) together imply \\(aRc\\).\n\nNone of these three properties follows from reflexivity alone. Their combinations define important classes of relations:\n\nClass | Required properties\nEquivalence relation | Reflexive, symmetric, transitive\n[[preorder | Preorder]]\nPartial order | Reflexive, antisymmetric, transitive\n\nFor example, reflexivity in an equivalence relation ensures that every element belongs to its own equivalence class."
    },
    {
      "heading": "Graph and matrix representations",
      "text": "A relation on a set can be represented by a directed graph, with an edge from \\(a\\) to \\(b\\) exactly when \\(aRb\\). Under this representation, reflexivity means that every vertex has a self-loop. This representation requires a graph convention that permits loops.\n\nFor a finite set \\(A=\\{a_1,\\ldots,a_n\\}\\), define the Boolean adjacency matrix \\(M\\) by\n\n\\[M_{ij}= \\begin{cases} 1,&a_iRa_j,\\\\ 0,&\\text{otherwise}. \\end{cases}\\]\n\nThe relation is reflexive exactly when every diagonal entry is \\(1\\):\n\n\\[M_{ii}=1\\qquad (1\\leq i\\leq n).\\]\n\nOff-diagonal entries are unrestricted. Consequently, the number of reflexive relations on a fixed \\(n\\)-element set is\n\n\\[2^{n^2-n},\\]\n\nbecause the \\(n\\) diagonal entries are fixed and the remaining \\(n^2-n\\) entries can be chosen independently."
    },
    {
      "heading": "Reflexive closure and preservation",
      "text": "The reflexive closure of a relation \\(R\\) on \\(A\\) is\n\n\\[R^{\\mathrm{ref}}=R\\cup\\Delta_A.\\]\n\nIt is the smallest reflexive relation on \\(A\\) containing \\(R\\). It adds precisely the missing self-pairs and leaves all pairs of distinct elements unchanged. In graph terms, it adds missing self-loops; in matrix terms, it sets every diagonal entry to \\(1\\).\n\nSeveral operations preserve reflexivity:\n\n- The intersection of reflexive relations on the same set is reflexive.\n- The union of any nonempty family of reflexive relations on the same set is reflexive.\n- The inverse relation \\(R^{-1}=\\{(b,a):(a,b)\\in R\\}\\) is reflexive whenever \\(R\\) is.\n- If \\(B\\subseteq A\\), the restriction \\(R\\cap(B\\times B)\\) is reflexive on \\(B\\) whenever \\(R\\) is reflexive on \\(A\\).\n- The composition of two reflexive relations on the same set is reflexive, since each element can serve as its own intermediate element.\n\nIn graph reachability, the reflexive transitive closure allows paths of length zero, so every vertex is reachable from itself. A transitive closure defined using only paths of positive length need not be reflexive: an isolated vertex, for example, has no positive-length path back to itself."
    }
  ],
  "links": [
    "binary-relation",
    "set-mathematics",
    "equivalence-relation",
    "partial-order",
    "subset",
    "cartesian-product",
    "empty-set",
    "real-number",
    "integer",
    "modular-arithmetic",
    "antisymmetric-relation",
    "transitive-relation",
    "equivalence-class",
    "directed-graph",
    "adjacency-matrix"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}