|
Modular Group
In mathematics, the modular group is the projective special linear group \operatorname(2,\mathbb Z) of 2\times 2 matrices with integer coefficients and determinant 1, such that the matrices A and -A are identified. The modular group acts on the upper-half of the complex plane by linear fractional transformations. The name "modular group" comes from the relation to moduli spaces, and not from modular arithmetic. Definition The modular group is the group of fractional linear transformations of the complex upper half-plane, which have the form :z\mapsto\frac, where a,b,c,d are integers, and ad-bc=1. The group operation is function composition. This group of transformations is isomorphic to the projective special linear group \operatorname(2,\mathbb Z), which is the quotient of the 2-dimensional special linear group \operatorname(2,\mathbb Z) by its center \. In other words, \operatorname(2,\mathbb Z) consists of all matrices :\begin a & b \\ c & d \end where a,b, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symplectic Group
In mathematics, the name symplectic group can refer to two different, but closely related, collections of mathematical groups, denoted and for positive integer ''n'' and field F (usually C or R). The latter is called the compact symplectic group and is also denoted by \mathrm(n). Many authors prefer slightly different notations, usually differing by factors of . The notation used here is consistent with the size of the most common matrices which represent the groups. In Cartan's classification of the simple Lie algebras, the Lie algebra of the complex group is denoted , and is the compact real form of . Note that when we refer to ''the'' (compact) symplectic group it is implied that we are talking about the collection of (compact) symplectic groups, indexed by their dimension . The name " symplectic group" was coined by Hermann Weyl as a replacement for the previous confusing names (line) complex group and Abelian linear group, and is the Greek analog of "complex". The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semigroup
In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively (just notation, not necessarily the elementary arithmetic multiplication): , or simply ''xy'', denotes the result of applying the semigroup operation to the ordered pair . Associativity is formally expressed as that for all ''x'', ''y'' and ''z'' in the semigroup. Semigroups may be considered a special case of magmas, where the operation is associative, or as a generalization of groups, without requiring the existence of an identity element or inverses. As in the case of groups or magmas, the semigroup operation need not be commutative, so is not necessarily equal to ; a well-known example of an operation that is associative but non-commutative is matrix multiplication. If the semigroup operation is commutative, then the semigroup is called a ''commutative semigroup' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pell's Equation
Pell's equation, also called the Pell–Fermat equation, is any Diophantine equation of the form x^2 - ny^2 = 1, where ''n'' is a given positive Square number, nonsquare integer, and integer solutions are sought for ''x'' and ''y''. In Cartesian coordinates, the equation is represented by a hyperbola; solutions occur wherever the curve passes through a point whose ''x'' and ''y'' coordinates are both integers, such as the Triviality (mathematics), trivial solution with ''x'' = 1 and ''y'' = 0. Joseph Louis Lagrange proved that, as long as ''n'' is not a square number, perfect square, Pell's equation has infinitely many distinct integer solutions. These solutions may be used to accurately Diophantine approximation, approximate the square root of ''n'' by rational numbers of the form ''x''/''y''. This equation was first studied extensively Indian mathematics, in India starting with Brahmagupta, who found an integer solution to 92x^2 + 1 = y^2 in his '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fibonacci Number
In mathematics, the Fibonacci sequence is a Integer sequence, sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted . Many writers begin the sequence with 0 and 1, although some authors start it from 1 and 1 and some (as did Fibonacci) from 1 and 2. Starting from 0 and 1, the sequence begins : 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... The Fibonacci numbers were first described in Indian mathematics as early as 200 BC in work by Pingala on enumerating possible patterns of Sanskrit poetry formed from syllables of two lengths. They are named after the Italian mathematician Leonardo of Pisa, also known as Fibonacci, who introduced the sequence to Western European mathematics in his 1202 book . Fibonacci numbers appear unexpectedly often in mathematics, so much so that there is an entire journal dedicated to their study, the ''Fibonacci Quarterly''. Appli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Farey Sequence
In mathematics, the Farey sequence of order ''n'' is the sequence of completely reduced fractions, either between 0 and 1, or without this restriction, which have denominators less than or equal to ''n'', arranged in order of increasing size. With the restricted definition, each Farey sequence starts with the value 0, denoted by the fraction , and ends with the value 1, denoted by the fraction (although some authors omit these terms). A ''Farey sequence'' is sometimes called a Farey series (mathematics), ''series'', which is not strictly correct, because the terms are not summed. Examples The Farey sequences of orders 1 to 8 are : :''F''1 = :''F''2 = :''F''3 = :''F''4 = :''F''5 = :''F''6 = :''F''7 = :''F''8 = Farey sunburst Plotting the numerators versus the denominators of a Farey sequence gives a shape like the one to the right, shown for Reflecting this shape around the diagonal and main axes generates the ''Farey sunburst'', shown below. The Farey sunburst ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continued Fraction
A continued fraction is a mathematical expression that can be written as a fraction with a denominator that is a sum that contains another simple or continued fraction. Depending on whether this iteration terminates with a simple fraction or not, the continued fraction is finite or infinite. Different fields of mathematics have different terminology and notation for continued fraction. In number theory the standard unqualified use of the term continued fraction refers to the special case where all numerators are 1, and is treated in the article simple continued fraction. The present article treats the case where numerators and denominators are sequences \,\ of constants or functions. From the perspective of number theory, these are called generalized continued fraction. From the perspective of complex analysis or numerical analysis, however, they are just standard, and in the present article they will simply be called "continued fraction". Formulation A continued fraction is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transcendental Number
In mathematics, a transcendental number is a real or complex number that is not algebraic: that is, not the root of a non-zero polynomial with integer (or, equivalently, rational) coefficients. The best-known transcendental numbers are and . The quality of a number being transcendental is called transcendence. Though only a few classes of transcendental numbers are known, partly because it can be extremely difficult to show that a given number is transcendental. Transcendental numbers are not rare: indeed, almost all real and complex numbers are transcendental, since the algebraic numbers form a countable set, while the set of real numbers and the set of complex numbers are both uncountable sets, and therefore larger than any countable set. All transcendental real numbers (also known as real transcendental numbers or transcendental irrational numbers) are irrational numbers, since all rational numbers are algebraic. The converse is not true: Not all irrational numbers are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irrational Number
In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being '' incommensurable'', meaning that they share no "measure" in common, that is, there is no length ("the measure"), no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself. Among irrational numbers are the ratio of a circle's circumference to its diameter, Euler's number ''e'', the golden ratio ''φ'', and the square root of two. In fact, all square roots of natural numbers, other than of perfect squares, are irrational. Like all real numbers, irrational numbers can be expressed in positional notation, notably as a decimal number. In the case of irrational numbers, the decimal expansion does not terminate, nor end ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projectively Extended Real Line
In real analysis, the projectively extended real line (also called the one-point compactification of the real line), is the extension of the set of the real numbers, \mathbb, by a point denoted . It is thus the set \mathbb\cup\ with the standard arithmetic operations extended where possible, and is sometimes denoted by \mathbb^* or \widehat. The added point is called the point at infinity, because it is considered as a neighbour of both ends of the real line. More precisely, the point at infinity is the limit of every sequence of real numbers whose absolute values are increasing and unbounded. The projectively extended real line may be identified with a real projective line in which three points have been assigned the specific values , and . The projectively extended real number line is distinct from the affinely extended real number line, in which and are distinct. Dividing by zero Unlike most mathematical models of numbers, this structure allows division by zero: : ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclid's Orchard
In mathematics, informally speaking, Euclid's orchard is an array of one-dimensional "trees" of unit height planted at the lattice points in one quadrant of a square lattice. More formally, Euclid's orchard is the set of line segments from to , where and are positive integers. The trees visible from the origin are those at lattice points , where and are coprime, i.e., where the fraction is in reduced form. The name ''Euclid's orchard'' is derived from the Euclidean algorithm. If the orchard is projected relative to the origin onto the plane (or, equivalently, drawn in perspective from a viewpoint at the origin) the tops of the trees form a graph of Thomae's function. The point projects to : \left ( \frac , \frac , \frac \right ). The solution to the Basel problem can be used to show that the proportion of points in the grid that have trees on them is approximately \tfrac and that the error of this approximation goes to zero in the limit as goes to infinity. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elliptic Functions
In the mathematical field of complex analysis, elliptic functions are special kinds of meromorphic functions, that satisfy two periodicity conditions. They are named elliptic functions because they come from elliptic integrals. Those integrals are in turn named elliptic because they first were encountered for the calculation of the arc length of an ellipse. Important elliptic functions are Jacobi elliptic functions and the Weierstrass \wp-function. Further development of this theory led to hyperelliptic functions and modular forms. Definition A meromorphic function is called an elliptic function, if there are two \mathbb- linear independent complex numbers \omega_1,\omega_2\in\mathbb such that : f(z + \omega_1) = f(z) and f(z + \omega_2) = f(z), \quad \forall z\in\mathbb. So elliptic functions have two periods and are therefore doubly periodic functions. Period lattice and fundamental domain If f is an elliptic function with periods \omega_1,\omega_2 it also holds ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
