BROWSE
ALPHABETICALLY
LEVEL:
Elementary
Advanced
Both
INCLUDE TOPICS:
Basic Math
Algebra
Analysis
Biography
Calculus
Comp Sci
Discrete
Economics
Foundations
Geometry
Graph Thry
History
Number Thry
Phys Sci
Statistics
Topology
Trigonometry
|
|
octahedron – Peano axioms
octahedron
A polyhedron having eight faces.
The faces of a regular octahedron are congruent, equilateral triangles.
 Cf. Platonic solid, polyhedron.
open disk
The interior of a circle.
Cf. neighborhood, disk.
open interval
An interval of the real number line (or any other totally ordered set) which does not include its endpoints. An interval containing only one of its endpoints is called half-open.
Cf. closed interval.
ordered field
See field.
ordered pair
An ordered tuple (a,b), the first element of which is called the abscissa, and the second element the ordinate, and for which (a,b) = (b,a) if and only if a = b. Functions, graphs of functions, and binary relations are represented as sets of ordered pairs. In standard set theory, the ordered pair (a,b) is defined to be the set { {a}, {a,b} }.
Cf. flat pair.
ordered set
A set with an order relation defined on it.
Cf. partial order, total order.
order of operations
As a matter of convention, in any given expression involving arithmetic and/or algebraic operations, operations within parentheses (or other grouping symbols) are evaluated first. Within this constraint, exponentiation precedes multiplication and division, and the latter precede addition and subtraction. Within these constraints, operations are evaluated from left to right.
order-preserving function
A function f is called order-preserving if it preserves the order of its domain elements, that is, if whenever x and y are elements of its domain such that x  y then f(x) f(y). Also called isotone or inctreasing. If f reverses the order of its domain elements, then it is called antitone or decreasing. In either case f is called monotone or monotonic. If whenever x < y we have f(x) < f(y), then f is called strictly increasing (resp. decreasing).
order relation
A relation R on a set S is an order relation exactly if it is reflexive, transitive and antisymmetric. Order relations are usually denoted by “ < ” or “ ”.
Cf. partial order, total order
order type
See total order.
ordinal
The class of ordinals is defined by:- 0 is an ordinal;
- if a is an ordinal, then a + 1 = a union {a}) is an ordinal;
- if A is a collection of ordinals, then union(A) is an ordinal;
- nothing else is an ordinal.
The class of ordinals is transitive, and is a well-founded, linear ordering. An ordinal of the form a + 1 is called a successor ordinal, and is otherwise called a limit ordinal.
Cf. Von Neumann Heirarchy.
ordinate
The second element of an ordered pair.
Cf. abscissa.
parabola
The locus of points in the plane whose distances from a fixed point, called the focus, and a fixed line, called the directrix, are equal.
Like the ellipse and hyperbola, the parabola is a conic section. See the related article for a full exposition.
Related article: Conics
paradox
A seemingly 'necessary' contradiction or absurdity. A paradox arising logically out of formal axioms is called an antinomy. True paradoxes may be broadly classified as paradoxes of logic, paradoxes of infinity, paradoxes of knowledge, paradoxes of language, and paradoxes of self-reference. See:Antistrephon Paradox
Banach-Tarski Paradox
Berry Paradox
Boundary Paradox
Finitude Paradox
First Boring Number Paradox
Grelling's Paradox
Grue-Bleen Paradox
Liar Paradox
Quine's Paradox
Prisoner's Dilemma
Russell Paradox
Santa Sentence Paradox
Sid's Paradox
Sorites Paradox
Unexpected Hanging Paradox
Zeno's Paradox of the Arrow
Zenos Paradox of the Moving Rows
Zeno's Paradox of the Tortoise and Achilles
Paradox of the Heap
See Sorites Paradox.
parallelogram
A quadrilateral with opposite sides (and opposite angles) equal.
parallel postulate
The 5th postulate of Euclidean geometry.
partially ordered set
A set with a partial order defined on it.
partial order
A partial order on a set X is a binary relation “” on X that is reflexive, transitive, and antisymmetric. A partial order in which every pair of elements is related is called a total order or linear order. A partial order on X imposes a lattice on X.
Cf. linear order, tree.
partition
General: A partition of a set X is a collection of subsets of X such that every element of X is in exactly one of the subsets. Such a partition is given by (and gives rise to) an equivalence relation on X. For example, division modulo 3 partitions the set of natural numbers into three subsets, each containing all those numbers leaving remainders of 0, 1, or 2 respectively when divided by 3.
Algebra: A partition of a matrix is a division of the matrix into conformable submatrices.
Analysis: A partition of a space is a collection of pairwise disjoint regions of the space whose union is the entire space. For example, a partition of an interval [a, b] of the real line is given by a finite set of points {xi} such that a = x1 < x2 < . . . < xn = b which divide the interval into disjoint subintervals.
Number Theory: Given a positive integer n, a partition of n is a set of positive integers whose sum is n. For example, 4 = 3 + 1 = 2 + 2 = 2 + 1 + 1 = 1 + 1 + 1 + 1 are the four possible partitions of the number 4.
Peano axioms
The axiom system developed by Giuseppe Peano to formalize arithmetic. The key to his method is the introduction of a “successor operation” S on numbers; if a is a number, then Sa is the successor of that number. In this way Peano reduced arithmetic to the conceptually primitive operation of counting.
The axioms are:- 0 is a number.
- If a is a number, then Sa is a number.
- If a and b are numbers, then a + 0 = a, and a + Sb = S(a + b).
- If a and b are numbers, then a × 0 = 0, and a × Sb = a × b + a.
- (Induction Principle.) For any formula f, if we have f(0) and if f(a) always implies f(Sa), then we have f(a) for all numbers a.
|
|
 
|