Global Information Lookup Global Information

Correspondence theorem information


In group theory, the correspondence theorem[1][2][3][4][5][6][7][8] (also the lattice theorem,[9] and variously and ambiguously the third and fourth isomorphism theorem[6][10]) states that if is a normal subgroup of a group , then there exists a bijection from the set of all subgroups of containing , onto the set of all subgroups of the quotient group . Loosely speaking, the structure of the subgroups of is exactly the same as the structure of the subgroups of containing , with collapsed to the identity element.

Specifically, if

G is a group,
, a normal subgroup of G,
, the set of all subgroups A of G that contain N, and
, the set of all subgroups of G/N,

then there is a bijective map such that

for all

One further has that if A and B are in then

  • if and only if ;
  • if then , where is the index of A in B (the number of cosets bA of A in B);
  • where is the subgroup of generated by
  • , and
  • is a normal subgroup of if and only if is a normal subgroup of .

This list is far from exhaustive. In fact, most properties of subgroups are preserved in their images under the bijection onto subgroups of a quotient group.

More generally, there is a monotone Galois connection between the lattice of subgroups of (not necessarily containing ) and the lattice of subgroups of : the lower adjoint of a subgroup of is given by and the upper adjoint of a subgroup of is a given by . The associated closure operator on subgroups of is ; the associated kernel operator on subgroups of is the identity. A proof of the correspondence theorem can be found here.

Similar results hold for rings, modules, vector spaces, and algebras. More generally an analogous result that concerns congruence relations instead of normal subgroups holds for any algebraic structure.

  1. ^ Derek John Scott Robinson (2003). An Introduction to Abstract Algebra. Walter de Gruyter. p. 64. ISBN 978-3-11-017544-8.
  2. ^ J. F. Humphreys (1996). A Course in Group Theory. Oxford University Press. p. 65. ISBN 978-0-19-853459-4.
  3. ^ H.E. Rose (2009). A Course on Finite Groups. Springer. p. 78. ISBN 978-1-84882-889-6.
  4. ^ J.L. Alperin; Rowen B. Bell (1995). Groups and Representations. Springer. p. 11. ISBN 978-1-4612-0799-3.
  5. ^ I. Martin Isaacs (1994). Algebra: A Graduate Course. American Mathematical Soc. p. 35. ISBN 978-0-8218-4799-2.
  6. ^ a b Joseph Rotman (1995). An Introduction to the Theory of Groups (4th ed.). Springer. pp. 37–38. ISBN 978-1-4612-4176-8.
  7. ^ W. Keith Nicholson (2012). Introduction to Abstract Algebra (4th ed.). John Wiley & Sons. p. 352. ISBN 978-1-118-31173-8.
  8. ^ Steven Roman (2011). Fundamentals of Group Theory: An Advanced Approach. Springer Science & Business Media. pp. 113–115. ISBN 978-0-8176-8301-6.
  9. ^ W.R. Scott: Group Theory, Prentice Hall, 1964, p. 27.
  10. ^ Jonathan K. Hodge; Steven Schlicker; Ted Sundstrom (2013). Abstract Algebra: An Inquiry Based Approach. CRC Press. p. 425. ISBN 978-1-4665-6708-5.

and 14 Related for: Correspondence theorem information

Request time (Page generated in 0.8401 seconds.)

Correspondence theorem

Last Update:

group theory, the correspondence theorem (also the lattice theorem, and variously and ambiguously the third and fourth isomorphism theorem) states that if...

Word Count : 775

Isomorphism theorems

Last Update:

isomorphism theorem. The first four statements are often subsumed under Theorem D below, and referred to as the lattice theorem, correspondence theorem, or fourth...

Word Count : 3467

Sahlqvist formula

Last Update:

kind of modal formula with remarkable properties. The Sahlqvist correspondence theorem states that every Sahlqvist formula is canonical, and corresponds...

Word Count : 859

Geometric Langlands correspondence

Last Update:

it follows as a consequence of Lafforgue's theorem. In mathematics, the classical Langlands correspondence is a collection of results and conjectures...

Word Count : 448

Fundamental theorem of Galois theory

Last Update:

most basic form, the theorem asserts that given a field extension E/F that is finite and Galois, there is a one-to-one correspondence between its intermediate...

Word Count : 2775

List of theorems

Last Update:

2-factor theorem (graph theory) 15 and 290 theorems (number theory) 2π theorem (Riemannian geometry) AF+BG theorem (algebraic geometry) ATS theorem (number...

Word Count : 5996

Nonabelian Hodge correspondence

Last Update:

Kähler manifold. The theorem can be considered a vast generalisation of the Narasimhan–Seshadri theorem which defines a correspondence between stable vector...

Word Count : 5131

Georg Cantor

Last Update:

Cantor–Bernstein–Schröder theorem. Cantor's 1874 Crelle paper was the first to invoke the notion of a 1-to-1 correspondence, though he did not use that...

Word Count : 9976

Maximum theorem

Last Update:

Maximum theorem, f ∗ {\displaystyle f^{*}} is continuous. It remains to verify that C ∗ {\displaystyle C^{*}} is an upper hemicontinuous correspondence with...

Word Count : 1868

Bijection

Last Update:

A bijection, bijective function, or one-to-one correspondence between two mathematical sets is a function such that each element of the second set (the...

Word Count : 2510

Takagi existence theorem

Last Update:

theory, the Takagi existence theorem states that for any number field K there is a one-to-one inclusion reversing correspondence between the finite abelian...

Word Count : 827

Ehrenfest theorem

Last Update:

mathematical support to the correspondence principle. The reason is that Ehrenfest's theorem is closely related to Liouville's theorem of Hamiltonian mechanics...

Word Count : 2829

Automated theorem proving

Last Update:

Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving...

Word Count : 2944

Sophie Germain

Last Update:

number theory, where he used it to prove Fermat's Last Theorem for p = 5 (see Correspondence with Legendre). Germain also proved or nearly proved several...

Word Count : 4507

PDF Search Engine © AllGlobal.net