Transitive relation

Binary relation R with the property that xRy and yRz implies xRz

In mathematics, a binary relation R on a set X is transitive if, for all elements a, b, c in X, whenever R relates a to b and b to c, then R also relates a to c. Every partial order and every equivalence relation is transitive. For example, less than and equality among real numbers are both transitive: If a < b and b < c then a < c; and if x = y and y = z then x = z.

Nº Q64861 ★★★

Rare · Knowledge

Transitive relation

Binary relation R with the property that xRy and yRz implies xRz

In mathematics, a binary relation R on a set X is transitive if, for all elements a, b, c in X, whenever R relates a to b and b to c, then R also relates a to c. Every partial order and every equivalence relation is transitive. For example, less than and equality among real numbers are both transitive: If a < b and b < c then a < c; and if x = y and y = z then x = z.

Last price

—

Floor price

—

7-day median

—

30-day sales

0

30-day range

—

In circulation

0

Price history

Show table
Datemedian LowHighsales

Sales history

Last sale
—
30-day average
—
30-day low
—
30-day high
—
Sales 7d
0
Sales 30d
0

No sales yet.

Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.

№ Numbered editions · 0 minted Next #1 · Score ×3
From Wikipedia

In mathematics, a binary relation R on a set X is transitive if, for all elements a, b, c in X, whenever R relates a to b and b to c, then R also relates a to c. Every partial order and every equivalence relation is transitive. For example, less than and equality among real numbers are both transitive: If a < b and b < c then a < c; and if x = y and y = z then x = z.

Text: Wikipédia, CC BY-SA 4.0. · Image: Jürgen-Michael Glubrecht (CC BY-SA 4.0) ·

Related cards

View card

Confirmation