|
Semistable Elliptic Curve
In algebraic geometry, a semistable abelian variety is an abelian variety defined over a global or local field, which is characterized by how it reduces at the primes of the field. For an abelian variety A defined over a field F with ring of integers R, consider the Néron model of A, which is a 'best possible' model of A defined over R. This model may be represented as a scheme over \mathrm(R) (cf. spectrum of a ring) for which the generic fibre constructed by means of the morphism \mathrm(F) \to \mathrm(R) gives back A. The Néron model is a smooth group scheme, so we can consider A^0, the connected component of the Néron model which contains the identity for the group law. This is an open subgroup scheme of the Néron model. For a residue field k, A^0_k is a group variety over k, hence an extension of an abelian variety by a linear group. If this linear group is an algebraic torus, so that A^0_k is a semiabelian variety, then A has ''semistable reduction'' at the prime corr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Geometry
Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials. Modern algebraic geometry is based on the use of abstract algebraic techniques, mainly from commutative algebra, for solving geometrical problems about these sets of zeros. The fundamental objects of study in algebraic geometry are algebraic varieties, which are geometric manifestations of solutions of systems of polynomial equations. Examples of the most studied classes of algebraic varieties are: plane algebraic curves, which include lines, circles, parabolas, ellipses, hyperbolas, cubic curves like elliptic curves, and quartic curves like lemniscates and Cassini ovals. A point of the plane belongs to an algebraic curve if its coordinates satisfy a given polynomial equation. Basic questions involve the study of the points of special interest like the singular points, the inflection points and the points at infinity. More advanced questions involve the topology of the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tate's Algorithm
In the theory of elliptic curves, Tate's algorithm takes as input an integral model of an elliptic curve ''E'' over \mathbb, or more generally an algebraic number field, and a prime or prime ideal ''p''. It returns the exponent ''f''''p'' of ''p'' in the conductor of ''E'', the type of reduction at ''p'', the local index : c_p= (\mathbb_p):E^0(\mathbb_p) where E^0(\mathbb_p) is the group of \mathbb_p-points whose reduction mod ''p'' is a non-singular point. Also, the algorithm determines whether or not the given integral model is minimal at ''p'', and, if not, returns an integral model with integral coefficients for which the valuation at ''p'' of the discriminant is minimal. Tate's algorithm also gives the structure of the singular fibers given by the Kodaira symbol or Néron symbol, for which, see elliptic surfaces: in turn this determines the exponent ''f''''p'' of the conductor ''E''. Tate's algorithm can be greatly simplified if the characteristic of the residue class fi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cusp (singularity)
In mathematics, a cusp, sometimes called spinode in old texts, is a point on a curve where a moving point must reverse direction. A typical example is given in the figure. A cusp is thus a type of singular point of a curve. For a plane curve defined by an analytic, parametric equation :\begin x &= f(t)\\ y &= g(t), \end a cusp is a point where both derivatives of and are zero, and the directional derivative, in the direction of the tangent, changes sign (the direction of the tangent is the direction of the slope \lim (g'(t)/f'(t))). Cusps are ''local singularities'' in the sense that they involve only one value of the parameter , in contrast to self-intersection points that involve more than one value. In some contexts, the condition on the directional derivative may be omitted, although, in this case, the singularity may look like a regular point. For a curve defined by an implicit equation :F(x,y) = 0, which is smooth, cusps are points where the terms of lowest degree ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Double Point
In geometry, a singular point on a curve is one where the curve is not given by a smooth embedding of a parameter. The precise definition of a singular point depends on the type of curve being studied. Algebraic curves in the plane Algebraic curves in the plane may be defined as the set of points satisfying an equation of the form f(x,y) = 0, where is a polynomial function If is expanded as f = a_0 + b_0 x + b_1 y + c_0 x^2 + 2c_1 xy + c_2 y^2 + \cdots If the origin is on the curve then . If then the implicit function theorem guarantees there is a smooth function so that the curve has the form near the origin. Similarly, if then there is a smooth function so that the curve has the form near the origin. In either case, there is a smooth map from to the plane which defines the curve in the neighborhood of the origin. Note that at the origin b_0 = \frac, \; b_1 = \frac, so the curve is non-singular or ''regular'' at the origin if at least one of the partial derivatives o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Singularity
In mathematics, a singularity is a point at which a given mathematical object is not defined, or a point where the mathematical object ceases to be well-behaved in some particular way, such as by lacking differentiability or analyticity. For example, the real function : f(x) = \frac has a singularity at x = 0, where the numerical value of the function approaches \pm\infty so the function is not defined. The absolute value function g(x) = , x, also has a singularity at x = 0, since it is not differentiable there. The algebraic curve defined by \left\ in the (x, y) coordinate system has a singularity (called a cusp) at (0, 0). For singularities in algebraic geometry, see singular point of an algebraic variety. For singularities in differential geometry, see singularity theory. Real analysis In real analysis, singularities are either discontinuities, or discontinuities of the derivative (sometimes also discontinuities of higher order derivatives). There are four kinds of discon ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Field
In mathematics, the characteristic of a ring , often denoted , is defined to be the smallest number of times one must use the ring's multiplicative identity (1) in a sum to get the additive identity (0). If this sum never reaches the additive identity the ring is said to have characteristic zero. That is, is the smallest positive number such that: :\underbrace_ = 0 if such a number exists, and otherwise. Motivation The special definition of the characteristic zero is motivated by the equivalent definitions characterized in the next section, where the characteristic zero is not required to be considered separately. The characteristic may also be taken to be the exponent of the ring's additive group, that is, the smallest positive integer such that: :\underbrace_ = 0 for every element of the ring (again, if exists; otherwise zero). Some authors do not include the multiplicative identity element in their requirements for a ring (see Multiplicative identity and the te ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Arithmetic
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book ''Disquisitiones Arithmeticae'', published in 1801. A familiar use of modular arithmetic is in the 12-hour clock, in which the day is divided into two 12-hour periods. If the time is 7:00 now, then 8 hours later it will be 3:00. Simple addition would result in , but clocks "wrap around" every 12 hours. Because the hour number starts over at zero when it reaches 12, this is arithmetic ''modulo'' 12. In terms of the definition below, 15 is ''congruent'' to 3 modulo 12, so "15:00" on a 24-hour clock is displayed "3:00" on a 12-hour clock. Congruence Given an integer , called a modulus, two integers and are said to be congruent modulo , if is a divisor of their difference (that is, if there is an integer such that ). Congruence modulo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-empty Set
In mathematics, the empty set is the unique set having no elements; its size or cardinality (count of elements in a set) is zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other theories, its existence can be deduced. Many possible properties of sets are vacuously true for the empty set. Any set other than the empty set is called non-empty. In some textbooks and popularizations, the empty set is referred to as the "null set". However, null set is a distinct notion within the context of measure theory, in which it describes a set of measure zero (which is not necessarily empty). The empty set may also be called the void set. Notation Common notations for the empty set include "", "\emptyset", and "∅". The latter two symbols were introduced by the Bourbaki group (specifically André Weil) in 1939, inspired by the letter Ø in the Danish and Norwegian alphabets. In the past, "0" was occasionally used as a symb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Set
In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example, :\ is a finite set with five elements. The number of elements of a finite set is a natural number (possibly zero) and is called the '' cardinality (or the cardinal number)'' of the set. A set that is not a finite set is called an ''infinite set''. For example, the set of all positive integers is infinite: :\. Finite sets are particularly important in combinatorics, the mathematical study of counting. Many arguments involving finite sets rely on the pigeonhole principle, which states that there cannot exist an injective function from a larger finite set to a smaller finite set. Definition and terminology Formally, a set is called finite if there exists a bijection :f\colon S\to\ for some natural number . The number is the set's cardinality, denoted as . The empty set o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Number
In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all rational numbers, also referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by boldface , or blackboard bold \mathbb. A rational number is a real number. The real numbers that are rational are those whose decimal expansion either terminates after a finite number of digits (example: ), or eventually begins to repeat the same finite sequence of digits over and over (example: ). This statement is true not only in base 10, but also in every other integer base, such as the binary and hexadecimal ones (see ). A real number that is not rational is called irrational. Irrational numbers include , , , and . Since the set of rational numbers is countable, and the set of real numbers is uncountable ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
