Chapter 2 - Basic Structures: Sets, Functions, Sequences, Sums, and Matrices Flashcards

Excludes: 2.6 - Matrices

1
Q

set

A

a collection of distinct objects

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

axiom

A

a basic assumption of a theory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

paradox

A

a logical inconsistency

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

element, a member of a set

A

an object in a set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

roster method

A

a method that describes a set by listing its elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

set builder notation

A

the notation that describes a set by stating a property an element must have to be a member

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

∅ (empty set, null set)

A

the set with no members

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

universal set

A

the set containing all objects under consideration

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Venn diagram

A

a graphical representation of a set or sets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

S = T (set equality)

A

S and T have the same elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

S ⊆ T (S is a subset of T)

A

every element of D is also an element of T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

S ⊂ T (S is a proper subset of T)

A

S is a subset of T and S ≠ T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

finite set

A

a set with n elements, where n is a nonnegative integer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

infinite set

A

a set that is not finite

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

|S| (the cardinality of S)

A

the number of elements in S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

P(S) (the power set of S)

A

the set of all subsets of S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

A ∪ B (the union of A and B)

A

the set containing those elements that are in at least one of A and B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

A ∩ B (the intersection of A and B)

A

the set containing those elements that are in both A and B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

A — B (the difference of A and B)

A

the set containing those elements that are in A but not in B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Ᾱ (the complement of A)

A

the set of elements in the universal set that are not in A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

A ⊕ B (the symmetric difference of A and B)

A

the set containing those elements in exactly one of A and B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

membership table

A

a table displaying the membership of elements in sets

23
Q

function from A to B

A

an assignment of exactly one element of B to each element of A

24
Q

domain of ƒ

A

the set A, where ƒ is a function from A to B

25
codomain of ƒ
the set B, where ƒ is a function from A to B
26
b is the inage of a under ƒ
b = ƒ(a)
27
a is a pre-image pf b under ƒ
ƒ(a) = b
28
range of ƒ
the set of images of ƒ
29
onto function, surjection
a function from A to B such that every element of B is the image of some element in A
30
one-to-one function, injection
a function such that the images of elements in its domain are distinct
31
one-to-one correspondence, bijection
a function that is both one-to-one and onto
32
inverse of ƒ
the function that reverses the correspondence given by ƒ (when ƒ is a bijection)
33
ƒ ○ g (composition of ƒ and g)
the function that assigns ƒ(g(x)) to x
34
⎿x⏌ (floor function)
the largest integer not exceeding x
35
⎾x⏋(ceiling function)
the smallest integer greater than or equal to x
36
partial function
an assignment to each element in a subset of the domain a unique element in the codomain
37
sequence
a function with domain that is a subset of the set of integers
38
geometric progression
a sequence in the form a, ar, ar², . . . , where a and r are real numbers
39
arithmetic progression
a sequence in the form a, a + d, a + 2d, . . . , where a and d are real numbers
40
string
a finite sequence
41
empty string
a string of length zero
42
recurrence relation
a equation that expresses the nth term aₙ of a sequence in terms of one or more of the previous terms of the sequence for all ontegers n greater than a particular integer
43
Σⁿₓ₌₁ aₓ
the sum of a₁ + a₂ + . . . + aₙ
44
Πⁿₓ₌₁ aₓ
the product of a₁a₂ . . . aₙ
45
cardinality
two sets A and B have the same cardinality if there is a one-to-one correspondence from A to B
46
countable set
a set that either is finite or can be placed in one-to-one correspondence with the set of positive integers
47
uncountable set
a set that is not countable
48
ℵ₀ (aleph null)
the cardinality of a countable set
49
ς
the cardinality of the set of real numbers
50
Cantor diagonalization argument
a proof technique used to show that the set of real numbers is uncountable
51
computable function
a function for which there is a computer program in some programming language that finds its values
52
uncomputable function
a function for which no computer program in a programming language exists that finds its values
53
continuum hypothesis
the statement that no set A exists such that ℵ₀ < |A| < ς