Mathematics for Natural Sciences - Core Concepts and Terminology

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

1/76

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering propositional logic, set theory, real and complex numbers, relations and functions, polynomials, transcendental functions, and analytic geometry of conic sections from the Mathematics for Natural Sciences lecture curriculum.

77 Terms

1
New cards

Proposition (or Statement)

A declarative sentence which has a truth value (either True or False, but not both).

2
New cards

Logical Conjunction

A compound proposition formed when two propositions pp and qq are joined with the connective "and" (∧\wedge); it is true if and only if both pp and qq are true.

3
New cards

Logical Disjunction

A compound proposition formed when two propositions pp and qq are joined with the connective "or" (∨\vee); it is false if and only if both pp and qq are false.

4
New cards

Logical Implication

A compound proposition formed when two propositions pp and qq are joined with the connective "implies" (⇒\Rightarrow); it is false if and only if the hypothesis pp is true and the conclusion qq is false.

5
New cards

Logical Bi-implication (or Logical Equivalence)

A proposition formed when two propositions pp and qq are joined with the connective "bi-implication" (⇔\Leftrightarrow); it is false if and only if pp and qq have different truth values.

6
New cards

Negation

A proposition formed by modifying a proposition pp to ¬p\neg p, whose truth value is FF if pp is TT and TT if pp is FF.

7
New cards

Compound Statement

A proposition formed by joining two or more propositions using one or more logical connectives.

8
New cards

Tautology

A compound proposition that is always true regardless of the truth values of its component propositions.

9
New cards

Contradiction

A compound proposition that is always false regardless of the truth values of its component propositions.

10
New cards

Contingency

A compound proposition that is neither a tautology nor a contradiction.

11
New cards

Open Statement (or Predicate)

A sentence containing one or more variables whose truth value depends on the specific values assigned to those variables.

12
New cards

Universal Quantifier

The logical operator corresponding to the phrase "for every xx" (or "for all xx", "for each xx"), symbolized by ∀\forall.

13
New cards

Existential Quantifier

The logical operator corresponding to the phrase "there exists an xx" (or "for some xx", "for at least one xx"), symbolized by ∃\exists.

14
New cards

Counterexample

A specific individual element in the universe of discourse for which an open proposition P(x)P(x) is false, demonstrating that ∀x P(x)\forall x\, P(x) is false.

15
New cards

Argument (Logical Deduction)

An assertion that a given set of statements p1,p2,…,pmp_1, p_2, \dots, p_m, called hypotheses or premises, yields another statement qq, called the conclusion.

16
New cards

Valid Argument Form

An argument form in which the conclusion qq is true whenever all the premises p1,p2,…,pmp_1, p_2, \dots, p_m are simultaneously true.

17
New cards

Set

A well-defined collection of objects that share a certain property or properties, such that one can determine whether or not a given object belongs to the collection.

18
New cards

Empty (or Null) Set

The unique set that contains no elements, denoted by ∅\emptyset or {}\{\}.

19
New cards

Subset

A relation between sets where set AA is contained in set BB (A⊆BA \subseteq B) if every element of AA is also an element of BB.

20
New cards

Proper Subset

A relation between sets where set AA is a subset of set BB (A⊂BA \subset B) such that every element of AA is in BB, but BB has at least one element that is not in AA.

21
New cards

Power Set

The set of all subsets of a given set AA, denoted by P(A)P(A); for a set with nn elements, it contains 2n2^n subsets.

22
New cards

Union of Sets

The set of all elements that belong to either set AA or set BB (or both), denoted by A∪B={x:x∈A or x∈B}A \cup B = \{x : x \in A \text{ or } x \in B\}.

23
New cards

Intersection of Sets

The set of all elements that belong to both set AA and set BB, denoted by A∩B={x:x∈A and x∈B}A \cap B = \{x : x \in A \text{ and } x \in B\}.

24
New cards

Disjoint Sets

Two sets AA and BB that have no elements in common, meaning that A∩B=∅A \cap B = \emptyset.

25
New cards

Relative Complement (Set Difference)

The set of all elements in AA that are not in BB, denoted by A∖BA \setminus B or A−BA - B.

26
New cards

Absolute Complement

The set of all elements in the universal set UU that are not in AA, denoted by A′A' or AcA^c, equivalent to U∖AU \setminus A.

27
New cards

Symmetric Difference

The set of elements belonging to either set AA or set BB but not both, denoted by AΔB=(A∖B)∪(B∖A)A \Delta B = (A \setminus B) \cup (B \setminus A).

28
New cards

Venn Diagram

A pictorial representation of sets using interlocking regions (typically circles) enclosed within a rectangle that represents the universal set UU.

29
New cards

Prime Number

A natural number greater than 11 that has only two factors: 11 and itself.

30
New cards

Composite Number

A natural number that has three or more factors.

31
New cards

Greatest Common Factor (GCF)

The greatest natural number that divides each of two or more given numbers without remainder.

32
New cards

Relatively Prime

A property of two numbers having a greatest common factor (GCF) equal to 11.

33
New cards

Least Common Multiple (LCM)

The smallest natural number that is a multiple of each of two or more given numbers.

34
New cards

Well Ordering Principle

The mathematical axiom stating that every non-empty subset of the set of natural numbers contains a smallest (least) element.

35
New cards

Rational Number

Any number that can be expressed in the form ab\frac{a}{b}, where aa and bb are integers and b≠0b \neq 0.

36
New cards

Irrational Number

A real number with a decimal expansion that is non-terminating and non-periodic, which cannot be expressed as a quotient of two integers.

37
New cards

Completeness Property of Real Numbers

The property stating that every non-empty subset of R\mathbb{R} that has an upper bound has a least upper bound (lub), and every non-empty subset that has a lower bound has a greatest lower bound (glb).

38
New cards

Complex Number

A number defined as an ordered pair (x,y)(x, y) of real numbers or written in the form z=x+iyz = x + iy, where x,y∈Rx, y \in \mathbb{R} and i2=−1i^2 = -1.

39
New cards

Conjugate of a Complex Number

For a complex number z=x+iyz = x + iy, the number denoted by zˉ=x−iy\bar{z} = x - iy, representing a reflection across the real axis.

40
New cards

Modulus (Norm) of a Complex Number

The non-negative real number ∣z∣=x2+y2|z| = \sqrt{x^2 + y^2}, which geometrically represents the distance from the point (x,y)(x, y) to the origin.

41
New cards

Principal Argument

The unique angle θ\theta formed by a complex number zz with the positive real axis that satisfies the condition −π<θ≤π-\pi < \theta \le \pi, denoted by Arg(z)\text{Arg}(z).

42
New cards

Polar Form of a Complex Number

The trigonometric representation z=r(cos⁡(θ)+isin⁡(θ))z = r(\cos(\theta) + i\sin(\theta)), where r=∣z∣r = |z| is the modulus and θ\theta is the argument.

43
New cards

De Moivre's Formula

The formula stating that for any complex number in polar form and any integer nn, [r(cos⁡(θ)+isin⁡(θ))]n=rn(cos⁡(nθ)+isin⁡(nθ))[r(\cos(\theta) + i\sin(\theta))]^n = r^n(\cos(n\theta) + i\sin(n\theta)).

44
New cards

Euler's Formula

The identity eiθ=cos⁡(θ)+isin⁡(θ)e^{i\theta} = \cos(\theta) + i\sin(\theta), allowing a complex number to be written in exponential form as z=reiθz = re^{i\theta}.

45
New cards

Cartesian Product

The set of all ordered pairs (a,b)(a, b) such that a∈Aa \in A and b∈Bb \in B, denoted by A×B={(a,b):a∈A and b∈B}A \times B = \{(a, b) : a \in A \text{ and } b \in B\}.

46
New cards

Relation

Any subset of the Cartesian product A×BA \times B defined between a set AA and a set BB.

47
New cards

Domain of a Relation

The set of all first coordinates of the ordered pairs in a relation RR, denoted by Dom(R)={a∈A:(a,b)∈R}\text{Dom}(R) = \{a \in A : (a, b) \in R\}.

48
New cards

Range of a Relation

The set of all second coordinates of the ordered pairs in a relation RR, denoted by Range(R)={b∈B:(a,b)∈R}\text{Range}(R) = \{b \in B : (a, b) \in R\}.

49
New cards

Function

A relation in which each element of the domain corresponds to exactly one element of the range.

50
New cards

One-to-One (1-1) Function

A function f:A→Bf : A \rightarrow B where no two distinct domain elements have the same image, meaning that f(x1)=f(x2)f(x_1) = f(x_2) implies x1=x2x_1 = x_2.

51
New cards

Onto Function

A function f:A→Bf : A \rightarrow B where every element in the codomain BB is the image of at least one element in the domain AA, meaning Range(f)=B\text{Range}(f) = B.

52
New cards

1-1 Correspondence

A function that is both one-to-one and onto.

53
New cards

Inverse Function

For a one-to-one function ff, the relation f−1={(y,x):(x,y)∈f}f^{-1} = \{(y, x) : (x, y) \in f\}, which reverses the original mapping.

54
New cards

Composition of Functions

The operation combining two functions ff and gg defined by (f∘g)(x)=f(g(x))(f \circ g)(x) = f(g(x)) for all xx in the domain of gg such that g(x)g(x) is in the domain of ff.

55
New cards

Polynomial Function

A function defined by p(x)=anxn+an−1xn−1+⋯+a1x+a0p(x) = a_n x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0, where nn is a non-negative integer, ai∈Ra_i \in \mathbb{R}, and an≠0a_n \neq 0.

56
New cards

Remainder Theorem

The algebraic theorem stating that when a polynomial p(x)p(x) of degree at least 11 is divided by x−rx - r, the resulting remainder is p(r)p(r).

57
New cards

Factor Theorem

The theorem stating that x−rx - r is a factor of a polynomial p(x)p(x) if and only if p(r)=0p(r) = 0.

58
New cards

Fundamental Theorem of Algebra

The theorem stating that every polynomial p(x)p(x) of degree n≥1n \ge 1 with complex coefficients has at least one zero in the complex number system.

59
New cards

Rational Function

A function expressed as the quotient of two polynomials, f(x)=n(x)d(x)f(x) = \frac{n(x)}{d(x)}, where d(x)≠0d(x) \neq 0.

60
New cards

Vertical Asymptote

The line x=ax = a where a function's values grow without bound (f(x)→∞f(x) \rightarrow \infty or f(x)→−∞f(x) \rightarrow -\infty) as xx approaches aa from the left or right.

61
New cards

Horizontal Asymptote

A horizontal line y=by = b approached arbitrarily closely by the function values f(x)f(x) as x→∞x \rightarrow \infty or x→−∞x \rightarrow -\infty.

62
New cards

Oblique (Slant) Asymptote

A non-horizontal line y=ax+by = ax + b (a≠0a \neq 0) approached by a rational function as x→±∞x \rightarrow \pm\infty, occurring when the numerator's degree is exactly one higher than the denominator's degree.

63
New cards

Exponential Function

A function of the form y=f(x)=bxy = f(x) = b^x, where the base b>0b > 0 and b≠1b \neq 1, defined for all real values of xx.

64
New cards

Logarithmic Function

The inverse of an exponential function, denoted by y=log⁡b(x)y = \log_b(x), meaning by=xb^y = x for base b>0b > 0 and b≠1b \neq 1.

65
New cards

Periodic Function

A function f(x)f(x) for which there exists a positive number pp such that f(x+p)=f(x)f(x + p) = f(x) for all xx in its domain; the smallest such pp is called the period.

66
New cards

Amplitude (of a Periodic Function)

Half the difference between the maximum and minimum values of a periodic function: A=12[max⁡(f(x))−min⁡(f(x))]A = \frac{1}{2}[\max(f(x)) - \min(f(x))].

67
New cards

Hyperbolic Sine Function

The function defined by combinations of exponential functions as sinh⁡(x)=ex−e−x2\sinh(x) = \frac{e^x - e^{-x}}{2}.

68
New cards

Hyperbolic Cosine Function

The function defined by combinations of exponential functions as cosh⁡(x)=ex+e−x2\cosh(x) = \frac{e^x + e^{-x}}{2}.

69
New cards

Circle

The locus of points in a plane each of which is equidistant from a fixed point (the center); the constant distance is called the radius.

70
New cards

Tangent Line to a Circle

A line that intersects a circle at exactly one point (the point of tangency), perpendicular to the radius drawn to that point.

71
New cards

Parabola

The set of points in a plane that are equidistant from a fixed line called the directrix and a fixed point not on the line called the focus.

72
New cards

Latus Rectum of a Parabola

The chord passing through the focus perpendicular to the axis of symmetry of the parabola, having length equal to the focal width 4p4p.

73
New cards

Ellipse

The locus of all points in a plane such that the sum of the distances from each point to two fixed points (foci) is constant (2a2a).

74
New cards

Eccentricity of an Ellipse

The ratio of the distance between the two foci to the length of the major axis, defined by e=cae = \frac{c}{a}, where 0<e<10 < e < 1.

75
New cards

Hyperbola

The set of all points in a plane such that the absolute difference of the distances from each point to two fixed points (foci) is constant (2a2a).

76
New cards

Eccentricity of a Hyperbola

The ratio of the distance between the foci to the length of the transverse axis, defined by e=cae = \frac{c}{a}, where e>1e > 1.

77
New cards

Conic Sections

Curves generated when a plane intersects a right circular double cone, forming a circle, ellipse, parabola, or hyperbola.