Relations and Functions

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/15

flashcard set

Earn XP

Description and Tags

This set of flashcards covers essential vocabulary and definitions related to relations and functions in mathematics.

Last updated 9:08 PM on 4/15/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

16 Terms

1
New cards

Mathematical Beauty

The concept that, although hard to define, allows recognition of aesthetically pleasing mathematics.

2
New cards

Relation (in Mathematics)

A relation from set A to set B is defined as an arbitrary subset of A × B.

3
New cards

Empty Relation

A relation in a set A where no element of A is related to any element of A, denoted as R = φ ⊂ A × A.

4
New cards

Universal Relation

A relation in a set A where each element of A is related to every element of A, denoted as R = A × A.

5
New cards

Reflexive Relation

A relation R in a set A is reflexive if (a, a) ∈ R for every a ∈ A.

6
New cards

Symmetric Relation

A relation R in a set A is symmetric if (a1, a2) ∈ R implies (a2, a1) ∈ R for all a1, a2 ∈ A.

7
New cards

Transitive Relation

A relation R in a set A is transitive if (a1, a2) ∈ R and (a2, a3) ∈ R implies (a1, a3) ∈ R for all a1, a2, a3 ∈ A.

8
New cards

Equivalence Relation

A relation R in a set A is an equivalence relation if it is reflexive, symmetric, and transitive.

9
New cards

One-One Function (Injective)

A function f: X → Y is one-one (or injective) if distinct elements of X map to distinct elements of Y.

10
New cards

Onto Function (Surjective)

A function f: X → Y is onto (or surjective) if every element of Y is the image of some element in X.

11
New cards

Bijective Function

A function f: X → Y is bijective if it is both one-one (injective) and onto (surjective).

12
New cards

Composition of Functions

The composition of functions f: A → B and g: B → C is denoted as gof: A → C defined by gof(x) = g(f(x)) for all x ∈ A.

13
New cards

Function Inverses

A function f is invertible if there exists a function g such that gof = IX and fog = IY, with g denoted as f^(-1).

14
New cards

Equivalence Class

The equivalence class [a] containing a ∈ X for an equivalence relation R is the subset of X containing all elements related to a.

15
New cards

Trivial Relation

Refers to either the empty relation or the universal relation.

16
New cards

Examples of Relations

Provide examples like sibling relations, age comparisons, or locality to illustrate how relations can be defined.