|
SL(2,Z)
In mathematics, the modular group is the projective special linear group of matrices with integer coefficients and determinant 1. The matrices and are identified. The modular group acts on the upper-half of the complex plane by fractional linear transformations, and the name "modular group" comes from the relation to moduli spaces and not from modular arithmetic. Definition The modular group is the group of linear fractional transformations of the upper half of the complex plane, which have the form :z\mapsto\frac, where , , , are integers, and . The group operation is function composition. This group of transformations is isomorphic to the projective special linear group , which is the quotient of the 2-dimensional special linear group over the integers by its center . In other words, consists of all matrices :\begin a & b \\ c & d \end where , , , are integers, , and pairs of matrices and are considered to be identical. The group operation is the usual mult ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...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" is due to 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 metaplect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generating Set Of A Group
In abstract algebra, a generating set of a group is a subset of the group set such that every element of the group can be expressed as a combination (under the group operation) of finitely many elements of the subset and their inverses. In other words, if ''S'' is a subset of a group ''G'', then , the ''subgroup generated by S'', is the smallest subgroup of ''G'' containing every element of ''S'', which is equal to the intersection over all subgroups containing the elements of ''S''; equivalently, is the subgroup of all elements of ''G'' that can be expressed as the finite product of elements in ''S'' and their inverses. (Note that inverses are only needed if the group is infinite; in a finite group, the inverse of an element can be expressed as a power of that element.) If ''G'' = , then we say that ''S'' ''generates'' ''G'', and the elements in ''S'' are called ''generators'' or ''group generators''. If ''S'' is the empty set, then is the trivial group , since we consider th ... [...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: ''x''·''y'', 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. The closure axiom is implied by the definition of a binary operation on a set. Some authors thus omit it and specify three axioms for a group and only one axiom (associativity) for a semigroup. As in the case of groups or magmas, the semigroup operation need not be commutative, so ''x''·''y'' is not necessarily equal to ''y''·''x''; a well-known example of an operation that is as ... [...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 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 trivial solution with ''x'' = 1 and ''y'' = 0. Joseph Louis Lagrange proved that, as long as ''n'' is not a perfect square, Pell's equation has infinitely many distinct integer solutions. These solutions may be used to accurately approximate the square root of ''n'' by rational numbers of the form ''x''/''y''. This equation was first studied extensively in India starting with Brahmagupta, who found an integer solution to 92x^2 + 1 = y^2 in his ''Brāhmasphuṭasiddhānta'' circa 628. Bhaskara II in the 12th century and Narayana Pandit i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fibonacci Number
In mathematics, the Fibonacci numbers, commonly denoted , form a sequence, the Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes (as did Fibonacci) from 1 and 2. Starting from 0 and 1, the first few values in the sequence are: :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, later known as Fibonacci, who introduced the sequence to Western European mathematics in his 1202 book ''Liber Abaci''. Fibonacci numbers appear unexpectedly often in mathematics, so much so that there is an entire journal dedicated to their study, the ''Fibonacci Quarterly''. Applications of Fibonacci numbers include co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Farey Sequence
In mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ..., the Farey sequence of order ''n'' is the sequence of completely reduced fractions, either between 0 and 1, or without this restriction, which when in lowest terms 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 = ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continued Fraction
In mathematics, a continued fraction is an expression (mathematics), expression obtained through an iterative process of representing a number as the sum of its integer part and the multiplicative inverse, reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. In a finite continued fraction (or terminated continued fraction), the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression (mathematics), infinite expression. In either case, all integers in the sequence, other than the first, must be positive number, positive. The integers a_i are called the coefficients or terms of the continued fraction. It is generally assumed that the numerator of all of the fractions is 1. If arbitrary values and/or function (mathematics), functions are used in place of one or more of the numerat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transcendental Number
In mathematics, a transcendental number is a number that is not algebraic—that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are and . 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 comprise 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 transcendental. Hence, the set of real numbers consists of non-overlapping rational, algebrai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irrational Number
In mathematics, the irrational numbers (from in- prefix assimilated to ir- (negative prefix, privative) + rational) 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 cas ... [...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 \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 the intuitive concept of 'number', this structure allows division by ... [...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 Limit or Limits may refe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
