DOCSLIB.ORG

(1)-(3), Let (A,+) Be an Abelian Group. an Endomorphism

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
(1)-(3), Let (A,+) Be an Abelian Group. an Endomorphism MATH 113 - WORKSHEET 5 SOLUTIONS In problems (1)-(3), let (A; +) be an abelian group. An endomorphism of A is a group homomorphism φ : A ! A. Let End(A) = Hom(A; A) be the set of endomorphisms of A. Given two endomorphisms of A, φ and , we can add them to obtain a new function (φ + ): A ! A, given by (φ + )(a) = φ(a) + (a). As usual, we can also compose them to obtain a new function (φ ◦ ): A ! A. (1) Show that (End(A); +) is an abelian group. Here + is addition of functions as defined above. This includes checking that if φ, 2 End(A), then (φ + ) 2 End(A). Solution: + is well-defined: Let φ, 2 End(A). We need to show φ+ 2 End(A). Indeed, Let a; b 2 A. Then (φ + )(a + b) = φ(a + b) + (a + b) = φ(a) + φ(b) + (a) + (b) = φ(a) + (a) + φ(b) + (b) = (φ + )(a) + (φ + )(b): Associativity: Let φ, ; θ 2 End(A). Then for all a 2 A, ((φ + ) + θ)(a) = (φ + )(a) + θ(a) = φ(a) + (a) + θ(a) = φ(a) + ( + θ)(a) = (φ + ( + θ))(a): So (φ + ) + θ = φ + ( + θ). Identity: The identity element of End(A) is the zero map z : A ! A, given by z(a) = 0. This is an endomorphism, since z(a + b) = 0 = 0 + 0 = z(a) + z(b). And for all φ 2 End(A), for all a 2 A, (z + φ)(a) = z(a) + φ(a) = 0 + φ(a) = φ(a) = φ(a) + 0 = φ(a) + z(a) = (φ + z)(a): So z + φ = φ = φ + z. 1 Inverses: Let φ 2 End(A). Then −φ : A ! A, given by (−φ)(a) = −φ(a) is the inverse of φ. This is an endomorphism, since (−φ)(a + b) = −φ(a + b) = −(φ(a) + φ(b)) = −φ(a) + −φ(b) = (−φ)(a) + (−φ)(b). And for all a 2 A, (φ + −φ)(a) = φ(a) + −φ(a) = 0 = z(a) = −φ(a) + φ(a) = (−φ + φ)(a): So φ + −φ = z = −φ + φ. Commutativity: Let φ, 2 End(A). Then for all a 2 A,(φ+ )(a) = φ(a)+ (a) = (a) + φ(a) = ( + φ)(a). So φ + = + φ. (2) Given the result of Problem (1), show that (End(A); +; ◦) is a ring with unity. Note that this ring is not commutative in general, since function composition is not commutative in general. Solution: Multiplication is well-defined: This is the fact that the composition of two homomorphisms is a homomorphism. Here's the check: Let φ, 2 End(A). Let a; b 2 A. Then (φ ◦ )(a + b) = φ( (a + b)) = φ( (a) + (b)) = φ( (a)) + φ( (b)) = (φ ◦ )(a) + (φ ◦ )(b). Multiplication is associative: This is just associativity of composition of functions. Distributive laws: Let φ, ; θ 2 End(A). For all a 2 A, (φ ◦ ( + θ))(a) = φ(( + θ)(a)) = φ( (a) + θ(a)) = φ( (a)) + φ(θ(a)) = (φ ◦ )(a) + (φ ◦ θ)(a) = (φ ◦ + φ ◦ θ)(a): So φ ◦ ( + θ) = φ ◦ + φ ◦ θ. Also, ((φ + ) ◦ θ)(a) = (φ + )(θ(a)) = φ(θ(a)) + (θ(a)) = (φ ◦ θ)(a) + ( ◦ θ)(a) = (φ ◦ θ + ◦ θ)(a): So (φ + ) ◦ θ = φ ◦ θ + ◦ θ. Unity: The unity is the identity for function composition, which is the identity function. Of course this is an endomorphism of A. (3) Given a ring with unity R, let A(R) = (R; +) be the abelian group of R under addition. Note that as sets, A(R) = R. Given r 2 R, show that λr : A(R) ! A(R), defined by λr(a) = ra, is an endomorphism. Given the result of Problem (2), show that the map φ : R ! End(A(R)) given by φ(r) = λr is a one-to-one ring homomorphism. This result is the analogue of Cayley's theorem for rings. Cayley's theorem states that every group embeds into the permutation group of some set (in fact, its own underlying set). We have shown that every ring embeds into the endomorphism ring of some abelian group (in fact, its own underlying abelian group). Solution: Let a; b 2 A(R). Then λr(a + b) = r(a + b) = ra + rb = λr(a) + λr(b), so λr 2 End(A(R)). φ is a ring homomorphism: Let r; s 2 R. We need to show that φ(r + s) = φ(r) + φ(s), that is, that λr+s = λr + λs. Indeed, for all a 2 A(R), λr+s(a) = (r + s)a = ra + sa = λr(a) + λs(a). We also need to show that φ(rs) = φ(r)φ(s), that is, that λrs = λr ◦ λs. Indeed, for all a 2 A(R), λrs(a) = rsa = r(λs(a)) = λr(λs(a)) = (λr ◦ λs)(a). φ is one to one: Let r; s 2 R, and suppose that φ(r) = φ(s). Then λr = λs, so in particular r = r1 = λr(1) = λs(1) = s1 = s. (4) Let R be a ring with unity, and let U(R) = fr 2 R j r is a unitg. Show that (U(R); ·) is a group. This includes showing that U(R) is closed under multiplication. If F is a field, conclude that F ∗ = F n f0g is an abelian group. The group U(R) is called the group of units of R and is sometimes denoted R×. Solution: U(R) is closed under multiplication: Let u; v 2 U(R). Then u−1 and v−1 exist in R, and (uv)−1 = v−1u−1, by the usual check, so uv 2 U(R). Associativity: This is just associativity of multiplication in R. Identity: R is a ring with unity, and 1−1 = 1, so 1 2 U(R). Inverses: Let u 2 U(R). Then u−1 exists in R, and moreover u−1 2 U(R), since (u−1)−1 = u. If F is a field, then F ∗ = U(F ), since every nonzero element of F is a unit. Moreover, U(R) is abelian, since multiplication is commutative in F . ∗ (5) Consider the field Zp, p prime. Use Problem (4) (i.e. the fact that Zp is a group) to ∗ p−1 p show that for all a 2 Zp, a = 1, and a = a. This result (and its restatement in (6)) is called Fermat's little theorem. ∗ ∗ Solution: Note that Zp is a finite group of order (p−1). Let a 2 Zp. By Lagrange's theorem, a has order d for some d j (p − 1). So de = p − 1 for some e 2 Z. Then ap−1 = ade = (ad)e = 1e = 1. Then ap = ap−1a = 1a = a. (6) Let p be a prime number. Use Problem (5) to show that if n 2 Z, with p - n, then np−1 ≡ 1 (mod p) and np ≡ n (mod p). Use this result to compute the remainder of 36000002 when divided by 7. ∗ p−1 Solution: Since p - n, n 6= 0 in Zp, so n 2 Zp. Then by Problem (5), n = p−1 p p n = 1 and n = n = n in Zp. These equations translate to the congruences np−1 ≡ 1 (mod p) and np ≡ n (mod p). 36000002 ≡ 36000000 · 32 ≡ (36)1000000 · 9 ≡ 11000000 · 9 ≡ 9 ≡ 2 (mod 7)..
Load more

Recommended publications
  • Pub . Mat . UAB Vol . 27 N- 1 on the ENDOMORPHISM RING of A
    Pub . Mat . UAB Vol . 27 n- 1 ON THE ENDOMORPHISM RING OF A FREE MODULE Pere Menal Throughout, let R be an (associative) ring (with 1) . Let F be the free right R-module, over an infinite set C, with endomorphism ring H . In this note we first study those rings R such that H is left coh- erent .By comparison with Lenzing's characterization of those rings R such that H is right coherent [8, Satz 41, we obtain a large class of rings H which are right but not left coherent . Also we are concerned with the rings R such that H is either right (left) IF-ring or else right (left) self-FP-injective . In particular we pro- ve that H is right self-FP-injective if and only if R is quasi-Frobenius (QF) (this is an slight generalization of results of Faith and .Walker [31 which assure that R must be QF whenever H is right self-i .njective) moreover, this occurs if and only if H is a left IF-ring . On the other hand we shall see that if' R is .pseudo-Frobenius (PF), that is R is an . injective cogenera- tortin Mod-R, then H is left self-FP-injective . Hence any PF-ring, R, that is not QF is such that H is left but not right self FP-injective . A left R-module M is said to be FP-injective if every R-homomorphism N -. M, where N is a -finitély generated submodule of a free module F, may be extended to F .
    [Show full text]
  • The Matrix Calculus You Need for Deep Learning
    The Matrix Calculus You Need For Deep Learning Terence Parr and Jeremy Howard July 3, 2018 (We teach in University of San Francisco's MS in Data Science program and have other nefarious projects underway. You might know Terence as the creator of the ANTLR parser generator. For more material, see Jeremy's fast.ai courses and University of San Francisco's Data Institute in- person version of the deep learning course.) HTML version (The PDF and HTML were generated from markup using bookish) Abstract This paper is an attempt to explain all the matrix calculus you need in order to understand the training of deep neural networks. We assume no math knowledge beyond what you learned in calculus 1, and provide links to help you refresh the necessary math where needed. Note that you do not need to understand this material before you start learning to train and use deep learning in practice; rather, this material is for those who are already familiar with the basics of neural networks, and wish to deepen their understanding of the underlying math. Don't worry if you get stuck at some point along the way|just go back and reread the previous section, and try writing down and working through some examples. And if you're still stuck, we're happy to answer your questions in the Theory category at forums.fast.ai. Note: There is a reference section at the end of the paper summarizing all the key matrix calculus rules and terminology discussed here. arXiv:1802.01528v3 [cs.LG] 2 Jul 2018 1 Contents 1 Introduction 3 2 Review: Scalar derivative rules4 3 Introduction to vector calculus and partial derivatives5 4 Matrix calculus 6 4.1 Generalization of the Jacobian .
    [Show full text]
  • IVC Factsheet Functions Comp Inverse
    Imperial Valley College Math Lab Functions: Composition and Inverse Functions FUNCTION COMPOSITION In order to perform a composition of functions, it is essential to be familiar with function notation. If you see something of the form “푓(푥) = [expression in terms of x]”, this means that whatever you see in the parentheses following f should be substituted for x in the expression. This can include numbers, variables, other expressions, and even other functions. EXAMPLE: 푓(푥) = 4푥2 − 13푥 푓(2) = 4 ∙ 22 − 13(2) 푓(−9) = 4(−9)2 − 13(−9) 푓(푎) = 4푎2 − 13푎 푓(푐3) = 4(푐3)2 − 13푐3 푓(ℎ + 5) = 4(ℎ + 5)2 − 13(ℎ + 5) Etc. A composition of functions occurs when one function is “plugged into” another function. The notation (푓 ○푔)(푥) is pronounced “푓 of 푔 of 푥”, and it literally means 푓(푔(푥)). In other words, you “plug” the 푔(푥) function into the 푓(푥) function. Similarly, (푔 ○푓)(푥) is pronounced “푔 of 푓 of 푥”, and it literally means 푔(푓(푥)). In other words, you “plug” the 푓(푥) function into the 푔(푥) function. WARNING: Be careful not to confuse (푓 ○푔)(푥) with (푓 ∙ 푔)(푥), which means 푓(푥) ∙ 푔(푥) . EXAMPLES: 푓(푥) = 4푥2 − 13푥 푔(푥) = 2푥 + 1 a. (푓 ○푔)(푥) = 푓(푔(푥)) = 4[푔(푥)]2 − 13 ∙ 푔(푥) = 4(2푥 + 1)2 − 13(2푥 + 1) = [푠푚푝푙푓푦] … = 16푥2 − 10푥 − 9 b. (푔 ○푓)(푥) = 푔(푓(푥)) = 2 ∙ 푓(푥) + 1 = 2(4푥2 − 13푥) + 1 = 8푥2 − 26푥 + 1 A function can even be “composed” with itself: c.
    [Show full text]
  • MA3203 Ring Theory Spring 2019 Norwegian University of Science and Technology Exercise Set 3 Department of Mathematical Sciences
    MA3203 Ring theory Spring 2019 Norwegian University of Science and Technology Exercise set 3 Department of Mathematical Sciences 1 Decompose the following representation into indecomposable representations: 1 1 1 1 1 1 1 1 2 2 2 k k k . α γ 2 Let Q be the quiver 1 2 3 and Λ = kQ. β δ a) Find the representations corresponding to the modules Λei, for i = 1; 2; 3. Let R be a ring and M an R-module. The endomorphism ring is defined as EndR(M) := ff : M ! M j f R-homomorphismg. b) Show that EndR(M) is indeed a ring. c) Show that an R-module M is decomposable if and only if its endomorphism ring EndR(M) contains a non-trivial idempotent, that is, an element f 6= 0; 1 such that f 2 = f. ∼ Hint: If M = M1 ⊕ M2 is decomposable, consider the projection morphism M ! M1. Conversely, any idempotent can be thought of as a projection mor- phism. d) Using c), show that the representation corresponding to Λe1 is indecomposable. ∼ Hint: Prove that EndΛ(Λe1) = k by showing that every Λ-homomorphism Λe1 ! Λe1 depends on a parameter l 2 k and that every l 2 k gives such a homomorphism. 3 Let A be a k-algebra, e 2 A be an idempotent and M be an A-module. a) Show that eAe is a k-algebra and that e is the identity element. For two A-modules N1, N2, we denote by HomA(N1;N2) the space of A-module morphism from N1 to N2.
    [Show full text]
  • Idempotent Lifting and Ring Extensions
    IDEMPOTENT LIFTING AND RING EXTENSIONS ALEXANDER J. DIESL, SAMUEL J. DITTMER, AND PACE P. NIELSEN Abstract. We answer multiple open questions concerning lifting of idempotents that appear in the literature. Most of the results are obtained by constructing explicit counter-examples. For instance, we provide a ring R for which idempotents lift modulo the Jacobson radical J(R), but idempotents do not lift modulo J(M2(R)). Thus, the property \idempotents lift modulo the Jacobson radical" is not a Morita invariant. We also prove that if I and J are ideals of R for which idempotents lift (even strongly), then it can be the case that idempotents do not lift over I + J. On the positive side, if I and J are enabling ideals in R, then I + J is also an enabling ideal. We show that if I E R is (weakly) enabling in R, then I[t] is not necessarily (weakly) enabling in R[t] while I t is (weakly) enabling in R t . The latter result is a special case of a more general theorem about completions.J K Finally, we give examplesJ K showing that conjugate idempotents are not necessarily related by a string of perspectivities. 1. Introduction In ring theory it is useful to be able to lift properties of a factor ring of R back to R itself. This is often accomplished by restricting to a nice class of rings. Indeed, certain common classes of rings are defined precisely in terms of such lifting properties. For instance, semiperfect rings are those rings R for which R=J(R) is semisimple and idempotents lift modulo the Jacobson radical.
    [Show full text]
  • The Logic of Recursive Equations Author(S): A
    The Logic of Recursive Equations Author(s): A. J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss, Glen T. Whitney Source: The Journal of Symbolic Logic, Vol. 63, No. 2 (Jun., 1998), pp. 451-478 Published by: Association for Symbolic Logic Stable URL: http://www.jstor.org/stable/2586843 . Accessed: 19/09/2011 22:53 Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Association for Symbolic Logic is collaborating with JSTOR to digitize, preserve and extend access to The Journal of Symbolic Logic. http://www.jstor.org THE JOURNAL OF SYMBOLIC LOGIC Volume 63, Number 2, June 1998 THE LOGIC OF RECURSIVE EQUATIONS A. J. C. HURKENS, MONICA McARTHUR, YIANNIS N. MOSCHOVAKIS, LAWRENCE S. MOSS, AND GLEN T. WHITNEY Abstract. We study logical systems for reasoning about equations involving recursive definitions. In particular, we are interested in "propositional" fragments of the functional language of recursion FLR [18, 17], i.e., without the value passing or abstraction allowed in FLR. The 'pure," propositional fragment FLRo turns out to coincide with the iteration theories of [1]. Our main focus here concerns the sharp contrast between the simple class of valid identities and the very complex consequence relation over several natural classes of models.
    [Show full text]
  • Ring (Mathematics) 1 Ring (Mathematics)
    Ring (mathematics) 1 Ring (mathematics) In mathematics, a ring is an algebraic structure consisting of a set together with two binary operations usually called addition and multiplication, where the set is an abelian group under addition (called the additive group of the ring) and a monoid under multiplication such that multiplication distributes over addition.a[›] In other words the ring axioms require that addition is commutative, addition and multiplication are associative, multiplication distributes over addition, each element in the set has an additive inverse, and there exists an additive identity. One of the most common examples of a ring is the set of integers endowed with its natural operations of addition and multiplication. Certain variations of the definition of a ring are sometimes employed, and these are outlined later in the article. Polynomials, represented here by curves, form a ring under addition The branch of mathematics that studies rings is known and multiplication. as ring theory. Ring theorists study properties common to both familiar mathematical structures such as integers and polynomials, and to the many less well-known mathematical structures that also satisfy the axioms of ring theory. The ubiquity of rings makes them a central organizing principle of contemporary mathematics.[1] Ring theory may be used to understand fundamental physical laws, such as those underlying special relativity and symmetry phenomena in molecular chemistry. The concept of a ring first arose from attempts to prove Fermat's last theorem, starting with Richard Dedekind in the 1880s. After contributions from other fields, mainly number theory, the ring notion was generalized and firmly established during the 1920s by Emmy Noether and Wolfgang Krull.[2] Modern ring theory—a very active mathematical discipline—studies rings in their own right.
    [Show full text]
  • Monoids: Theme and Variations (Functional Pearl)
    University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science 7-2012 Monoids: Theme and Variations (Functional Pearl) Brent A. Yorgey University of Pennsylvania, [email protected] Follow this and additional works at: https://repository.upenn.edu/cis_papers Part of the Programming Languages and Compilers Commons, Software Engineering Commons, and the Theory and Algorithms Commons Recommended Citation Brent A. Yorgey, "Monoids: Theme and Variations (Functional Pearl)", . July 2012. This paper is posted at ScholarlyCommons. https://repository.upenn.edu/cis_papers/762 For more information, please contact [email protected]. Monoids: Theme and Variations (Functional Pearl) Abstract The monoid is a humble algebraic structure, at first glance ve en downright boring. However, there’s much more to monoids than meets the eye. Using examples taken from the diagrams vector graphics framework as a case study, I demonstrate the power and beauty of monoids for library design. The paper begins with an extremely simple model of diagrams and proceeds through a series of incremental variations, all related somehow to the central theme of monoids. Along the way, I illustrate the power of compositional semantics; why you should also pay attention to the monoid’s even humbler cousin, the semigroup; monoid homomorphisms; and monoid actions. Keywords monoid, homomorphism, monoid action, EDSL Disciplines Programming Languages and Compilers | Software Engineering | Theory and Algorithms This conference paper is available at ScholarlyCommons: https://repository.upenn.edu/cis_papers/762 Monoids: Theme and Variations (Functional Pearl) Brent A. Yorgey University of Pennsylvania [email protected] Abstract The monoid is a humble algebraic structure, at first glance even downright boring.
    [Show full text]
  • Contents 3 Homomorphisms, Ideals, and Quotients
    Ring Theory (part 3): Homomorphisms, Ideals, and Quotients (by Evan Dummit, 2018, v. 1.01) Contents 3 Homomorphisms, Ideals, and Quotients 1 3.1 Ring Isomorphisms and Homomorphisms . 1 3.1.1 Ring Isomorphisms . 1 3.1.2 Ring Homomorphisms . 4 3.2 Ideals and Quotient Rings . 7 3.2.1 Ideals . 8 3.2.2 Quotient Rings . 9 3.2.3 Homomorphisms and Quotient Rings . 11 3.3 Properties of Ideals . 13 3.3.1 The Isomorphism Theorems . 13 3.3.2 Generation of Ideals . 14 3.3.3 Maximal and Prime Ideals . 17 3.3.4 The Chinese Remainder Theorem . 20 3.4 Rings of Fractions . 21 3 Homomorphisms, Ideals, and Quotients In this chapter, we will examine some more intricate properties of general rings. We begin with a discussion of isomorphisms, which provide a way of identifying two rings whose structures are identical, and then examine the broader class of ring homomorphisms, which are the structure-preserving functions from one ring to another. Next, we study ideals and quotient rings, which provide the most general version of modular arithmetic in a ring, and which are fundamentally connected with ring homomorphisms. We close with a detailed study of the structure of ideals and quotients in commutative rings with 1. 3.1 Ring Isomorphisms and Homomorphisms • We begin our study with a discussion of structure-preserving maps between rings. 3.1.1 Ring Isomorphisms • We have encountered several examples of rings with very similar structures. • For example, consider the two rings R = Z=6Z and S = (Z=2Z) × (Z=3Z).
    [Show full text]
  • Computing the Endomorphism Ring of an Ordinary Elliptic Curve Over a Finite Field
    COMPUTING THE ENDOMORPHISM RING OF AN ORDINARY ELLIPTIC CURVE OVER A FINITE FIELD GAETAN BISSON AND ANDREW V. SUTHERLAND Abstract. We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field Fq. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first algorithm in terms of log q, while our bound for the second algorithm depends primarily on log jDE j, where DE is the discriminant of the order isomorphic to End(E). As a byproduct, our method yields a short certificate that may be used to verify that the endomorphism ring is as claimed. 1. Introduction Let E be an ordinary elliptic curve defined over a finite field Fq, and let π denote the Frobenius endomorphism of E. We may view π as an element of norm q in the p integer ring of some imaginary quadratic field K = Q DK : p t + v D (1) π = K with 4q = t2 − v2D : 2 K The trace of π may be computed as t = q + 1 − #E. Applying Schoof's algorithm to count the points on E=Fq, this can be done in polynomial time [29]. The funda- 2 mental discriminant DK and the integer v are then obtained by factoring 4q − t , which can be accomplished probabilistically in subexponential time [25]. The endomorphism ring of E is isomorphic to an order O(E) of K. Once v and DK are known, there are only finitely many possibilities for O(E), since (2) Z [π] ⊆ O(E) ⊆ OK : 2 Here Z [π] denotes the order generated by π, with discriminant Dπ = v DK , and OK is the maximal order of K (its ring of integers), with discriminant DK .
    [Show full text]
  • Math 311 - Introduction to Proof and Abstract Mathematics Group Assignment # 15 Name: Due: at the End of Class on Tuesday, March 26Th
    Math 311 - Introduction to Proof and Abstract Mathematics Group Assignment # 15 Name: Due: At the end of class on Tuesday, March 26th More on Functions: Definition 5.1.7: Let A, B, C, and D be sets. Let f : A B and g : C D be functions. Then f = g if: → → A = C and B = D • For all x A, f(x)= g(x). • ∈ Intuitively speaking, this definition tells us that a function is determined by its underlying correspondence, not its specific formula or rule. Another way to think of this is that a function is determined by the set of points that occur on its graph. 1. Give a specific example of two functions that are defined by different rules (or formulas) but that are equal as functions. 2. Consider the functions f(x)= x and g(x)= √x2. Find: (a) A domain for which these functions are equal. (b) A domain for which these functions are not equal. Definition 5.1.9 Let X be a set. The identity function on X is the function IX : X X defined by, for all x X, → ∈ IX (x)= x. 3. Let f(x)= x cos(2πx). Prove that f(x) is the identity function when X = Z but not when X = R. Definition 5.1.10 Let n Z with n 0, and let a0,a1, ,an R such that an = 0. The function p : R R is a ∈ ≥ ··· ∈ 6 n n−1 → polynomial of degree n with real coefficients a0,a1, ,an if for all x R, p(x)= anx +an−1x + +a1x+a0.
    [Show full text]
  • List of Mathematical Symbols by Subject from Wikipedia, the Free Encyclopedia
    List of mathematical symbols by subject From Wikipedia, the free encyclopedia This list of mathematical symbols by subject shows a selection of the most common symbols that are used in modern mathematical notation within formulas, grouped by mathematical topic. As it is virtually impossible to list all the symbols ever used in mathematics, only those symbols which occur often in mathematics or mathematics education are included. Many of the characters are standardized, for example in DIN 1302 General mathematical symbols or DIN EN ISO 80000-2 Quantities and units – Part 2: Mathematical signs for science and technology. The following list is largely limited to non-alphanumeric characters. It is divided by areas of mathematics and grouped within sub-regions. Some symbols have a different meaning depending on the context and appear accordingly several times in the list. Further information on the symbols and their meaning can be found in the respective linked articles. Contents 1 Guide 2 Set theory 2.1 Definition symbols 2.2 Set construction 2.3 Set operations 2.4 Set relations 2.5 Number sets 2.6 Cardinality 3 Arithmetic 3.1 Arithmetic operators 3.2 Equality signs 3.3 Comparison 3.4 Divisibility 3.5 Intervals 3.6 Elementary functions 3.7 Complex numbers 3.8 Mathematical constants 4 Calculus 4.1 Sequences and series 4.2 Functions 4.3 Limits 4.4 Asymptotic behaviour 4.5 Differential calculus 4.6 Integral calculus 4.7 Vector calculus 4.8 Topology 4.9 Functional analysis 5 Linear algebra and geometry 5.1 Elementary geometry 5.2 Vectors and matrices 5.3 Vector calculus 5.4 Matrix calculus 5.5 Vector spaces 6 Algebra 6.1 Relations 6.2 Group theory 6.3 Field theory 6.4 Ring theory 7 Combinatorics 8 Stochastics 8.1 Probability theory 8.2 Statistics 9 Logic 9.1 Operators 9.2 Quantifiers 9.3 Deduction symbols 10 See also 11 References 12 External links Guide The following information is provided for each mathematical symbol: Symbol: The symbol as it is represented by LaTeX.
    [Show full text]