Symmetric relation in the context of "Sister-wife"

Relations are ways in which several entities stand to each other. They usually connect distinct entities but some associate an entity with itself. The adicity of a relation is the number of entities it connects. The direction of a relation is the order in which the elements are related to each other. The converse of a relation carries the same information and has the opposite direction, like the contrast between "two is less than five" and "five is greater than two". Both relations and properties express features in reality with a key difference being that relations apply to several entities while properties belong to a single entity.

Many types of relations are discussed in the academic literature. Internal relations, like resemblance, depend only on the monadic properties of the relata. They contrast with external relations, like spatial relations, which express characteristics that go beyond what their relata are like. Formal relations, like identity, involve abstract and topic-neutral ideas while material relations, like loving, have concrete and substantial contents. Logical relations are relations between propositions while causal relations connect concrete events. Symmetric, transitive, and reflexive relations are distinguished by their structural features.

In mathematics, a binary relation ${\displaystyle R}$ on a set ${\displaystyle X}$ is reflexive if it relates every element of ${\displaystyle X}$ to itself.

An example of a reflexive relation is the relation "is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to possess reflexivity. Along with symmetry and transitivity, reflexivity is one of three properties defining equivalence relations.

In mathematics, equality is a relationship between two quantities or expressions, stating that they have the same value, or represent the same mathematical object. Equality between A and B is denoted with an equals sign as A = B, and read "A equals B". A written expression of equality is called an equation or identity depending on the context. Two objects that are not equal are said to be distinct.

Equality is often considered a primitive notion, meaning it is not formally defined, but rather informally said to be "a relation each thing bears to itself and nothing else". This characterization is notably circular ("nothing else"), reflecting a general conceptual difficulty in fully characterizing the concept. Basic properties about equality like reflexivity, symmetry, and transitivity have been understood intuitively since at least the ancient Greeks, but were not symbolically stated as general properties of relations until the late 19th century by Giuseppe Peano. Other properties like substitution and function application weren't formally stated until the development of symbolic logic.

In mathematics, computer science, and network science, network theory is a part of graph theory. It defines networks as graphs where the vertices or edges possess attributes. Network theory analyses these networks over the symmetric relations or asymmetric relations between their (discrete) components.

Network theory has applications in many disciplines, including statistical physics, particle physics, computer science, electrical engineering, biology, archaeology, linguistics, economics, finance, operations research, climatology, ecology, public health, sociology, psychology, and neuroscience. Applications of network theory include logistical networks, the World Wide Web, Internet, gene regulatory networks, metabolic networks, social networks, epistemological networks, etc.; see List of network theory topics for more examples.

In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is numerical equality. Any number ${\displaystyle a}$ is equal to itself (reflexive). If ${\displaystyle a=b}$, then ${\displaystyle b=a}$ (symmetric). If ${\displaystyle a=b}$ and ${\displaystyle b=c}$, then ${\displaystyle a=c}$ (transitive).

Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each other if and only if they belong to the same equivalence class.

In mathematics, a homogeneous relation (also called endorelation) on a set X is a binary relation between X and itself, i.e. it is a subset of the Cartesian product X × X. This is commonly phrased as "a relation on X" or "a (binary) relation over X". An example of a homogeneous relation is the relation of kinship, where the relation is between people.

Common types of endorelations include orders, graphs, and equivalences. Specialized studies of order theory and graph theory have developed understanding of endorelations. Terminology particular for graph theory is used for description, with an ordinary (undirected) graph presumed to correspond to a symmetric relation, and a general endorelation corresponding to a directed graph. An endorelation R corresponds to a logical matrix of 0s and 1s, where the expression xRy (x is R-related to y) corresponds to an edge between x and y in the graph, and to a 1 in the square matrix of R. It is called an adjacency matrix in graph terminology.