The notion of cardinality, as now understood, was formulated by Georg Cantor, the originator of set theory, in 1874–1884. Cardinality can be used to compare an aspect of finite sets; e.g. the sets {1,2,3} and {4,5,6} are not equal, but have the same cardinality, namely three (this is established by the existence of a one-to-one correspondence between the two sets; e.g. {1->4, 2->5, 3->6}).
The formula would be useful neither to compute the force between two objects of finite mass nor to compute their motions. If an infinite mass object were to exist, any object of finite mass would be attracted with infinite force (and hence acceleration) by the infinite mass object, which is not what we can observe in reality.
The most widely studied systems of axiomatic set theory imply that all sets form a cumulative hierarchy. Such systems come in two flavors, those whose ontology consists of:
One way to prove that a class is proper is to place it in bijection with the class of all ordinal numbers. This method is used, for example, in the proof that there is no free complete lattice.
Name:
Anonymous2013-08-31 10:56
The reason that we are able to choose least elements from subsets of the natural numbers is the fact that the natural numbers are well-ordered: every nonempty subset of the natural numbers has a unique least element under the natural ordering.
Cantor also developed a large portion of the general theory of cardinal numbers; he proved that there is a smallest transfinite cardinal number (ℵ0, aleph-null) and that for every cardinal number, there is a next-larger cardinal
The logarithm of an infinite cardinal number κ is defined as the least cardinal number μ such that κ ≤ 2μ. Logarithms of infinite cardinals are useful in some fields of mathematics, for example in the study of cardinal invariants of topological spaces, though they lack some of the properties that logarithms of positive real numbers possess.
Name:
Anonymous2013-08-31 14:07
This point of view does not mean that infinity cannot be used in physics. For convenience's sake, calculations, equations, theories and approximations often use infinite series, unbounded functions, etc., and may involve infinite quantities.
Name:
Anonymous2013-08-31 14:52
Zermelo set theory, which replaces the axiom schema of replacement with that of separation;
Name:
Anonymous2013-08-31 15:37
For example, Russell's paradox suggests a proof that the class of all sets which do not contain themselves is proper, and the Burali-Forti paradox suggests that the class of all ordinal numbers is proper.
Name:
Anonymous2013-08-31 16:22
A proof requiring the axiom of choice may establish the existence of an object without explicitly defining the object in the language of set theory. For example, while the axiom of choice implies that there is a well-ordering of the real numbers, there are models of set theory with the axiom of choice in which no well-ordering of the reals is definable.
If two small categories are weakly equivalent, then they are equivalent.
Name:
Anonymous2013-08-31 17:52
Many significant areas of mathematics can be formalised by category theory as categories. Category theory is an abstraction of mathematics itself that allows many intricate and subtle mathematical results in these fields to be stated, and proved, in a much simpler way than without the use of categories.
Each category is distinguished by properties that all its objects have in common, such as the empty set or the product of two topologies, yet in the definition of a category, objects are considered to be atomic, i.e., we do not know whether an object A is a set, a topology, or any other abstract concept.
Name:
Anonymous2013-08-31 19:23
In the category of small categories, functors can be thought of as morphisms.
Name:
Anonymous2013-08-31 19:32
He graduated from Berlin's Luisenstädtisches Gymnasium in 1889. He then studied mathematics, physics and philosophy at the universities of Berlin, Halle and Freiburg. He finished his doctorate in 1894 at the University of Berlin, awarded for a dissertation on the calculus of variations (Untersuchungen zur Variationsrechnung). Zermelo remained at the University of Berlin, where he was appointed assistant to Planck, under whose guidance he began to study hydrodynamics. In 1897, Zermelo went to Göttingen, at that time the leading centre for mathematical research in the world, where he completed his habilitation thesis in 1899.
κ0 = 1 (in particular 00 = 1), see empty function.
Name:
Anonymous2013-08-31 21:02
The continuum hypothesis states that there is no cardinal number between the cardinality of the reals and the cardinality of the natural numbers, that is, \mathbf{c} = leph_1 = eth_1 (see Beth one). However, this hypothesis can neither be proved nor disproved within the widely accepted Zermelo–Fraenkel set theory, even assuming the Axiom of Choice.
Intersection of the sets A and B, denoted A ∩ B, is the set of all objects that are members of both A and B. The intersection of {1, 2, 3} and {2, 3, 4} is the set {2, 3} .
Name:
Anonymous2013-08-31 22:32
Ludwig Wittgenstein questioned the way Zermelo–Fraenkel set theory handled infinities.Wittgenstein's views about the foundations of mathematics were later criticised by Georg Kreisel and Paul Bernays, and investigated by Crispin Wright, among others.
Until the late 19th century, the axiom of choice was often used implicitly, although it had not yet been formally stated. For example, after having established that the set X contains only non-empty sets, a mathematician might have said "let F(s) be one of the members of s for all s in X."
Hausdorff maximal principle: In any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset. The restricted principle "Every partially ordered set has a maximal totally ordered subset" is also equivalent to AC over ZF.
Name:
Anonymous2013-09-01 0:48
In all models of ZF¬C there is a vector space with no basis.
automorphism if f is both an endomorphism and an isomorphism. aut(a) denotes the class of automorphisms of a.
Name:
Anonymous2013-09-01 2:18
The morphism f has a left inverse if there is a morphism g:Y → X such that g ∘ f = idX. The left inverse g is also called a retraction of f.[1] Morphisms with left inverses are always monomorphisms, but the converse is not always true in every category; a monomorphism may fail to have a left-inverse.
Tangent and cotangent bundles: The map which sends every differentiable manifold to its tangent bundle and every smooth map to its derivative is a covariant functor from the category of differentiable manifolds to the category of vector bundles. Likewise, the map which sends every differentiable manifold to its cotangent bundle and every smooth map to its pullback is a contravariant functor.