From 9e3359db0c7e050488e08ec70d3168cce178a52d Mon Sep 17 00:00:00 2001 From: Avi Parshan Date: Wed, 20 Mar 2024 14:34:54 +0200 Subject: [PATCH] escape chars for discrete --- math/discrete/README.MD | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/math/discrete/README.MD b/math/discrete/README.MD index 65d0d4a..d0acd13 100644 --- a/math/discrete/README.MD +++ b/math/discrete/README.MD @@ -88,13 +88,13 @@ tags: - Cartesian product: - * A × B = { (a, b) | a ∈ A and b ∈ B } + * `A × B = { (a, b) | a ∈ A and b ∈ B }` * A × B ≠ B × A (unless A = B) * A ∩ (A × B) = ∅ - * |A × B| = |A| × |B| + * `|A × B| = |A| × |B|` - Distribution: @@ -116,13 +116,13 @@ tags: * implies that the relation R contains all possible pairs that can be formed by taking one element from set A and one element from set B. It's a relation where every element of A is related to every element of B. -- Inverse relation is R⁻¹ = { (b, a) | (a, b) ∈ R } +- Inverse relation is R⁻¹ = `{ (b, a) | (a, b) ∈ R }` * R consists of all pairs in R but with their elements reversed. If (a,b) is in R, then (b,a) is in R⁻¹ - Composition of relations: - * R ∘ S = { (a, c) | ∃ b : (a, b) ∈ R and (b, c) ∈ S } + * R ∘ S = `{ (a, c) | ∃ b : (a, b) ∈ R and (b, c) ∈ S }` * Set of pairs (a,c) such that exists an element b for which both (a,b) is in R and (b,c) is in S