HOME BUTTON   PRIME HOMEPAGE
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







  function – i

function   Given a binary relation R on sets A and B, we say that the R is a function if each element of A is paired with at most one element of B. In this case we call A the domain set, and we call B the range set. If f is such a function and the ordered pair (x,y) is an element of the function, we typically write f(x) = y.
More generally, if R is an n-place relation, then R is a function of n-1 variables if each (n-1)-tuple is matched with at most one element of the range set (i.e., the nth set of the Cartesian product on which the relation is defined). If in addition there is at most one element of the domain set matched with any given element of the range set, then the function is called “one-to-one” or injective. If the function maps at least one element of the domain set to every element of its range set, then it is called “onto” or surjective. A function which is both injective and surjective is called bijective. Functions with range in the real numbers or complex numbers are called real-valued or complex-valued respectively.


functional calculus   See predicate calculus.

Fundamental Theorem of Algebra   The field of complex numbers is algebraically closed, that is, any polynomial with complex coefficients has a complex root.

Fundamental Theorem of Arithmetic   Every natural number is either prime or may be decomposed uniquely into prime factors.

Fundamental Theorem of Calculus   Intitively, that the integral and derivative are inverse operatorations on functions. The fundamental theorem is commonly expressed in either one of two formal guises:


Cf. Riemann integral.


g.c.d.   Abbreviation for greatest common divisor.

GCH   See: generalized continuum hypothesis.

generalized continuum hypothesis   The claim that there is no set of intermediate cardinality between any given set and its power set. The GCH is independent of (i.e., cannot be proved true or false by) the known axioms of set theory.
Cf. continuum hypothesis.


Related article: Gödel's Theorems
Related MiniText: Infinity -- You Can't Get There From Here...

geometric series   An infinite series such that the ratio of consecutive terms is constant. Such a series may be denoted


where r is the common ratio. A geometric series converges if and only if the common ratio is less than 1, in which case the sum of the series is given by


Cf. arithmetic series, harmonic series.


Related article: Series

g.l.b.   Abbreviation for greatest lower bound.

graph   General: A picture or diagram representing one or more relationships among certain objects or quantities.
Functions: The collection of ordered tuples (x,y), consisting of domain elements x (possibly also tuples) and corresponding range elements y. Although informally we often mean the picture when we speak of the graph of a function, the graph should always be formally thought of as a set of tuples.
Graph Theory: A collection of nodes (also called vertices), together with a set of edges joining the nodes. Formally, a graph G is a set of vertices V, a set of edges E, and a symmetric relation between them specifying incidence. Every edge must be incident on exactly two (not necessarily distinct) vertices, called its ends. Two vertices incident on the same edge are called adjacent. Graphs are often represented pictorially, with the vertices being points (or small circles or squares or some such), and the edges being curves (often line segments), with the endpoints of each such curve being the ends of that edge in the graph.
Cf. Konigsberg Bridge Problem.


greatest common divisor   The greatest common divisor of two natural numbers a and b is the largest natural number c such that c divides a and c divides b.

greatest lower bound   A lower bound which is greater than or equal to every other lower bound.
Cf. Least upper bound.


Greek   Letters of the Greek alphabet are commonly used in mathematics. See the article for a full description.

harmonic series   The infinite series whose terms are the reciprocals of the natural numbers


This series diverges, i.e., the sum does not exist.


Related article: Series

Hempel’s Ravens Paradox   A paradox of inductive logic described by the philosopher C.G. Hempel. See the article for a complete exposition.

homomorphism   A function f from one algebra to another is called a homomorphism if it preserves operations on elements, that is, if for any a, b in the domain, f(ab) = f(a)f(b).
Cf. group homomorphism, ring homomorphism.


hyperbola   The locus of points in the plane, the difference of whose distances from two fixed points, called the foci, remains constant.


Like the ellipse and parabola, the hyperbola is a conic section.


Related article: Conics

hyperset   A set which is not well-founded, i.e., which involves self-membership or, equivalently, an infinite descending membership chain. Example: the Quine atom x = {x}.

hypotenuse   On a right triangle, the side opposite the right angle.

i   See imaginary number.

 





Fibonacci Board Game banner




Graph Paper Download banner




Greek Alphabet Poster banner




Die-Cast Polyhedra banner




Hex Game Download banner




Erdos Quote Mug Banner




Polyhedra Model Paper Banner

   
function – i



HOME | ABOUT | CONTACT | AD INFO | PRIVACY

Copyright © 1997-2013, Math Academy Online™ / Platonic Realms™. Except where otherwise prohibited, material on this site may be printed for personal classroom use without permission by students and instructors for non-profit, educational purposes only. All other reproduction in whole or in part, including electronic reproduction or redistribution, for any purpose, except by express written agreement is strictly prohibited. Please send comments, corrections, and enquiries using our contact page.