World Library  
Flag as Inappropriate
Email this Article

Elliptic curve

Article Id: WHEBN0000010225
Reproduction Date:

Title: Elliptic curve  
Author: World Heritage Encyclopedia
Language: English
Subject: Glossary of arithmetic and Diophantine geometry, Fermat's Last Theorem, Group theory, Gauss–Manin connection, Weil conjectures
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Elliptic curve

A catalog of elliptic curves. Region shown is [−3,3]2 (For a = 0 and b = 0 the function is not smooth and therefore not an elliptic curve.)

In mathematics, an elliptic curve (EC) is a smooth, projective algebraic curve of genus one, on which there is a specified point O. An elliptic curve is in fact an abelian variety – that is, it has a multiplication defined algebraically, with respect to which it is a (necessarily commutative) group – and O serves as the identity element. Often the curve itself, without O specified, is called an elliptic curve.

Any elliptic curve can be written as a plane algebraic curve defined by an equation of the form:

y^2 = x^3 + ax + b

which is non-singular; that is, its graph has no cusps or self-intersections. (When the characteristic of the coefficient field is equal to 2 or 3, the above equation is not quite general enough to comprise all non-singular cubic curves; see below for a more precise definition.) The point O is actually the "point at infinity" in the projective plane.

If y2 = P(x), where P is any polynomial of degree three in x with no repeated roots, then we obtain a nonsingular plane curve of genus one, which is thus an elliptic curve. If P has degree four and is square-free this equation again describes a plane curve of genus one; however, it has no natural choice of identity element. More generally, any algebraic curve of genus one, for example from the intersection of two quadric surfaces embedded in three-dimensional projective space, is called an elliptic curve, provided that it has at least one rational point to act as the identity.

Using the theory of elliptic functions, it can be shown that elliptic curves defined over the complex numbers correspond to embeddings of the torus into the complex projective plane. The torus is also an abelian group, and in fact this correspondence is also a group isomorphism.

Elliptic curves are especially important in number theory, and constitute a major area of current research; for example, they were used in the proof, by Andrew Wiles (assisted by Richard Taylor), of Fermat's Last Theorem. They also find applications in elliptic curve cryptography (ECC) and integer factorization.

An elliptic curve is not an ellipse: see elliptic integral for the origin of the term. Topologically, a complex elliptic curve is a torus.

Elliptic curves over the real numbers

Graphs of curves y2 = x3x and y2 = x3x + 1

Although the formal definition of an elliptic curve is fairly technical and requires some background in algebraic geometry, it is possible to describe some features of elliptic curves over the real numbers using only high school algebra and geometry.

In this context, an elliptic curve is a plane curve defined by an equation of the form

y^2 = x^3 + ax + b

where a and b are real numbers. This type of equation is called a Weierstrass equation.

The definition of elliptic curve also requires that the curve be non-singular. Geometrically, this means that the graph has no cusps, self-intersections, or isolated points. Algebraically, this involves calculating the discriminant

\Delta = -16(4a^3 + 27b^2)

The curve is non-singular if and only if the discriminant is not equal to zero. (Although the factor −16 seems irrelevant here, it turns out to be convenient in a more advanced study of elliptic curves.)

The (real) graph of a non-singular curve has two components if its discriminant is positive, and one component if it is negative. For example, in the graphs shown in figure to the right, the discriminant in the first case is 64, and in the second case is −368.

The group law

By adding a "point at infinity", we obtain the projective version of this curve. If P and Q are two points on the curve (i.e. their coordinates are solutions to the equation of the curve), then we can uniquely describe a third point which lies in the intersection of the curve with the line through P and Q. Usually there is a unique third point in the intersection (if the line is tangent to the curve at a point, then that point has to be counted twice; and if the line is parallel to the y-axis, we define the third point as the point "at infinity").

It is then possible to introduce a group operation, +, on the curve with the following properties: we consider the point at infinity to be 0, the identity of the group; and if a straight line intersects the curve at the points P, Q and R, then we require that P + Q + R = 0 in the group. One can check that this turns the curve into an abelian group, and thus into an abelian variety.

Let K be a field over which the curve is defined (i.e., the coefficients of the defining equation or equations of the curve are in K) and denote the curve by E. Then the K-rational points of E are the points on E whose coordinates all lie in K, including the point at infinity. The set of K-rational points is denoted by E(K). It, too, forms a group, because properties of polynomial equations show that if P is in E(K), then −P is also in E(K), and if two of P, Q, and R are in E(K), then so is the third. Additionally, if K is a subfield of L, then E(K) is a subgroup of E(L).

The above group can be described algebraically as well as geometrically. Given the curve y2 = x3pxq over the field K (whose characteristic we assume to be neither 2 nor 3), and points P = (xP, yP) and Q = (xQ, yQ) on the curve, assume first that xPxQ. Let s be the slope of the line containing P and Q; i.e.,

s = \frac{y_P - y_Q}{x_P - x_Q}

Since K is a field, s is well-defined. Then we can define R = P + Q = (xR, −yR) by

\begin{align} x_R &= s^2 - x_P - x_Q \\ y_R &= y_P + s(x_R - x_P) \end{align}

If xP = xQ (third and fourth panes above), then there are two options: if yP = −yQ, including the case where yP = yQ = 0, then the sum is defined as 0; thus, the inverse of each point on the curve is found by reflecting it across the x-axis. If yP = yQ ≠ 0 (second pane), then R = P + P = 2P = (xR, −yR) is given by

\begin{align} s &= \frac{3{x_P}^2 - p}{2y_P}\\ x_R &= s^2 - 2x_P\\ y_R &= y_P + s(x_R - x_P) \end{align}

Associativity

EllipticGroup

All of the group laws except associativity follow immediately from the geometrical definition of the group operation. This animation illustrates geometrically the associativity law.

Notice that the sum of the three values on any of the six lines is zero. The location of all nine points is determined by the elliptic curve together with the locations of zero, a, b and c. The central point of the nine lies on the line through a and b + c, and also on the line through a + b and c. Associativity of the addition law is equivalent to the fact that the curve passes through the central point in the grid. From this fact, the equality of −(a + (b + c)) and −((a + b) + c) follows.

The elliptic curve and the point zero are fixed in this animation while a, b and c move independently of each other.

Elliptic curves over the complex numbers

An elliptic curve over the complex numbers is obtained as a quotient of the complex plane by a lattice Λ, here spanned by two fundamental periods ω1 and ω2. The four-torsion is also shown, corresponding to the lattice 1/4 Λ containing Λ.

The formulation of elliptic curves as the embedding of a torus in the complex projective plane follows naturally from a curious property of Weierstrass's elliptic functions. These functions and their first derivative are related by the formula

\wp'(z)^2 = 4\wp(z)^3 -g_2\wp(z) - g_3

Here, g2 and g3 are constants; \wp(z) is the Weierstrass elliptic function and \wp'(z) its derivative. It should be clear that this relation is in the form of an elliptic curve (over the complex numbers). The Weierstrass functions are doubly periodic; that is, they are periodic with respect to a lattice Λ; in essence, the Weierstrass functions are naturally defined on a torus T = C/Λ. This torus may be embedded in the complex projective plane by means of the map

z \mapsto [1 :\wp(z) : \wp'(z)]

This map is a group isomorphism, carrying the natural group structure of the torus into the projective plane. It is also an isomorphism of Riemann surfaces, so topologically, a given elliptic curve looks like a torus. If the lattice Λ is related by multiplication by a non-zero complex number c to a lattice cΛ, then the corresponding curves are isomorphic. Isomorphism classes of elliptic curves are specified by the j-invariant.

The isomorphism classes can be understood in a simpler way as well. The constants g2 and g3, called the modular invariants, are uniquely determined by the lattice, that is, by the structure of the torus. However, the complex numbers form the splitting field for polynomials with real coefficients, and so the elliptic curve may be written as

y^2 = x(x - 1)(x - \lambda)

One finds that

g_2 = \frac{4^{\frac{1}{3}}}{3} (\lambda^2 - \lambda + 1)

and

g_3 = \frac{1}{27} (\lambda + 1)(2\lambda^2 - 5\lambda + 2)

so that the modular discriminant is

\Delta = g_2^3 - 27g_3^2 = \lambda^2(\lambda - 1)^2

Here, λ is sometimes called the modular lambda function.

Note that the uniformization theorem implies that every compact Riemann surface of genus one can be represented as a torus.

This also allows an easy understanding of the torsion points on an elliptic curve: if the lattice Λ is spanned by the fundamental periods ω1 and ω2, then the n-torsion points are the (equivalence classes of) points of the form

\frac{a}{n} \omega_1 + \frac{b}{n} \omega_2

for a and b integers in the range from 0 to n−1.

Over the complex numbers, every elliptic curve has nine inflection points. Every line through two of these points also passes through a third inflection point; the nine points and 12 lines formed in this way form a realization of the Hesse configuration.

Elliptic curves over the rational numbers

A curve E defined over the field of rational numbers is also defined over the field of real numbers. Therefore the law of addition (of points with real coordinates) by the tangent and secant method can be applied to E. The explicit formulae show that the sum of two points P and Q with rational coordinates has again rational coordinates, since the line joining P and Q has rational coefficients. This way, one shows that the set of rational points of E forms a subgroup of the group of real points of E. As this group, it is an abelian group, that is, P + Q = Q + P.

The structure of rational points

The most important result is that all points can be constructed by the method of tangents and secants starting with a finite number of points. More precisely[1] the Mordell–Weil theorem states that the group E(Q) is a finitely generated (abelian) group. By the fundamental theorem of finitely generated abelian groups it is therefore a finite direct sum of copies of Z and finite cyclic groups.

The proof of that theorem[2] rests on two ingredients: first, one shows that for any integer m > 1, the quotient group E(Q)/mE(Q) is finite (weak Mordell–Weil theorem). Second, introducing a height function h on the rational points E(Q) defined by h(P0) = 0 and h(P) = log max(|p|, |q|) if P (unequal to the point at infinity P0) has as abscissa the rational number x = pq (with coprime p and q). This height function h has the property that h(mP) grows roughly like the square of m. Moreover, only finitely many rational points with height smaller than any constant exist on E.

The proof of the theorem is thus a variant of the method of infinite descent[3] and relies on the repeated application of Euclidean divisions on E: let PE(Q) be a rational point on the curve, writing P as the sum 2P1 + Q1 where Q1 is a fixed representant of P in E(Q)/2E(Q), the height of P1 is about 14 of the one of P (more generally, replacing 2 by any m > 1, and 14 by 1m2). Redoing the same with P1, that is to say P1 = 2P2 + Q2, then P2 = 2P3 + Q3, etc. finally expresses P as an integral linear combination of points Qi and of points whose height is bounded by a fixed constant chosen in advance: by the weak Mordell–Weil theorem and the second property of the height function P is thus expressed as an integral linear combination of a finite number of fixed points.

So far, the theorem is not effective since there is no known general procedure for determining the representants of E(Q)/mE(Q).

The rank of E(Q), that is the number of copies of Z in E(Q) or, equivalently, the number of independent points of infinite order, is called the rank of E. The Birch and Swinnerton-Dyer conjecture is concerned with determining the rank. One conjectures that it can be arbitrarily large, even if only examples with relatively small rank are known. The elliptic curve with biggest exactly known rank is

y2 + xy + y = x3x2 + 31368015812338065133318565292206590792820353345x + 302038802698566087335643188429543498624522041683874493555186062568159847

It has rank 19, found by Noam Elkies in 2009.[4] Curves of rank at least 28 are known, but their rank is not exactly known.

As for the groups constituting the torsion subgroup of E(Q), the following is known[5] the torsion subgroup of E(Q) is one of the 15 following groups (a theorem due to Barry Mazur): Z/NZ for N = 1, 2, …, 10, or 12, or Z/2Z × Z/2NZ with N = 1, 2, 3, 4. Examples for every case are known. Moreover, elliptic curves whose Mordell–Weil groups over Q have the same torsion groups belong to a parametrized family.[6]

The Birch and Swinnerton-Dyer conjecture

The Birch and Swinnerton-Dyer conjecture (BSD) is one of the Millennium problems of the Clay Mathematics Institute. The conjecture relies on analytic and arithmetic objects defined by the elliptic curve in question.

At the analytic side, an important ingredient is a function of a complex variable, L, the Hasse–Weil zeta function of E over Q. This function is a variant of the Riemann zeta function and Dirichlet L-functions. It is defined as an Euler product, with one factor for every prime number p.

For a curve E over Q given by a minimal equation

y^2 + a_1xy + a_3y = x^3 + a_2x^2 + a_4x + a_6

with integral coefficients ai, reducing the coefficients modulo p defines an elliptic curve over the finite field Fp (except for a finite number of primes p, where the reduced curve has a singularity and thus fails to be elliptic, in which case E is said to be of bad reduction at p).

The zeta function of an elliptic curve over a finite field Fp is, in some sense, a generating function assembling the information of the number of points of E with values in the finite field extensions of Fp, Fpn. It is given,[7]

Z(E(\mathbf{F}_p)) = \exp \left(\sum \mathrm{card} \left[E({\mathbf F}_{p^n})\right]\frac{T^n}{n}\right)

The interior sum of the exponential resembles the development of the logarithm and, in fact, the so-defined zeta function is a rational function:

Z(E(\mathbf{F}_p)) = \frac{1 - a_pT + pT^2}{(1 - T)(1 - pT)}

The Hasse–Weil zeta function of E over Q is then defined by collecting this information together, for all primes p. It is defined by

L(E(\mathbf{Q}), s) = \prod_p \left(1 - a_p p^{-s} + \varepsilon(p)p^{1 - 2s}\right)^{-1}

where ε(p) = 1 if E has good reduction at p and 0 otherwise (in which case ap is defined differently than above).

This product converges for Re(s) > 3/2 only. Hasse's conjecture affirms that the L-function admits an analytic continuation to the whole complex plane and satisfies a functional equation relating, for any s, L(E, s) to L(E, 2 − s). In 1999 this was shown to be a consequence of the proof of the Shimura–Taniyama–Weil conjecture, which asserts that every elliptic curve over Q is a modular curve, which implies that its L-function is the L-function of a modular form whose analytic continuation is known.

One can therefore speak about the values of L(E, s) at any complex number s. The Birch-Swinnerton-Dyer conjecture relates the arithmetic of the curve to the behavior of its L-function at s = 1. More precisely, it affirms that the order of the L-function at s = 1 equals the rank of E and predicts the leading term of the Laurent series of L(E, s) at that point in terms of several quantities attached to the elliptic curve.

Much like the Riemann hypothesis, this conjecture has multiple consequences, including the following two:

  • Let n be an odd square-free integer. Assuming the Birch and Swinnerton-Dyer conjecture, n is the area of a right triangle with rational side lengths (a congruent number) if and only if the number of triplets of integers (x, y, z) satisfying 2x^2 + y^2 + 8z^2 = n is twice the number of triples satisfying 2x^2 + y^2 + 32z^2 = n. This statement, due to Tunnell, is related to the fact that n is a congruent number if and only if the elliptic curve y^2 = x^3 - n^2x has a rational point of infinite order (thus, under the Birch and Swinnerton-Dyer conjecture, its L-function has a zero at 1). The interest in this statement is that the condition is easily verified.[8]
  • In a different direction, certain analytic methods allow for an estimation of the order of zero in the center of the critical strip of families of L-functions. Admitting the BSD conjecture, these estimations correspond to information about the rank of families of elliptic curves in question. For example:[9] suppose the generalized Riemann hypothesis and the BSD conjecture, the average rank of curves given by y^2=x^3+ax+b is smaller than 2.

The modularity theorem and its application to Fermat's Last Theorem

The modularity theorem, once known as the Taniyama–Shimura–Weil conjecture, states that every elliptic curve E over Q is a modular curve, that is to say, its Hasse–Weil zeta function is the L-function of a modular form of weight 2 and level N, where N is the conductor of E (an integer divisible by the same prime numbers as the discriminant of E, Δ(E).) In other words, if, for Re(s) > 3/2, one writes the L-function in the form

L(E(\mathbf{Q}), s) = \sum_{n>0}a(n)n^{-s}

the expression

\sum a(n) q^n, \qquad q = \exp(2 \pi i z)

defines a parabolic modular newform of weight 2 and level N. For prime numbers ℓ not dividing N, the coefficient a(ℓ) of the form equals ℓ – the number of solutions of the minimal equation of the curve modulo ℓ.

For example,[10] to the elliptic curve y^2 - y = x^3 -x with discriminant (and conductor) 37, is associated the form

f(z) = q - 2q^2 - 3q^3 + 2q^4 - 2q^5 + 6q^6 + \cdots, \qquad q = \exp(2 \pi i z)

For prime numbers ℓ distinct of 37, one can verify the property about the coefficients. Thus, for ℓ = 3, the solutions of the equation modulo 3 are (0, 0), (0, 1), (2, 0), (1, 0), (1, 1), (2, 1), as and a(3) = 3 − 6 = −3.

The conjecture, going back to the fifties, was completely proven by 1999 using ideas of Andrew Wiles, who proved it in 1994 for a large family of elliptic curves.[11]

There are several formulations of the conjecture. Showing that they are equivalent is difficult and was a main topic of number theory in the second half of the 20th century. The modularity of an elliptic curve E of conductor N can be expressed also by saying that there is a non-constant rational map defined over Q, from the modular curve X0(N) to E. In particular, the points of E can be parametrized by modular functions.

For example, a modular parametrization of the curve y^2 - y = x^3 - x is given by[12]

\begin{align} x(z) &= q^{-2} + 2q^{-1} + 5 + 9q + 18q^2 + 29q^3 + 51q^4 +\ldots\\ y(z) &= q^{-3} + 3q^{-2} + 9q^{-1} + 21 + 46q + 92q^2 + 180q^3 +\ldots \end{align}

where, as above, q = exp(2πiz). The functions x(z) and y(z) are modular of weight 0 and level 37; in other words they are meromorphic, defined on the upper half-plane Im(z) > 0 and satisfy

x\left(\frac{az + b}{cz + d}\right) = x(z)

and likewise for y(z) for all integers a, b, c, d with adbc = 1 and 37|c.

Another formulation depends on the comparison of Galois representations attached on the one hand to elliptic curves, and on the other hand to modular forms. The latter formulation has been used in the proof the conjecture. Dealing with the level of the forms (and the connection to the conductor of the curve) is particularly delicate.

The most spectacular application of the conjecture is the proof of Fermat's Last Theorem (FLT). Suppose that for a prime p > 5, the Fermat equation

a^p + b^p = c^p

has a solution with non-zero integers, hence a counter-example to FLT. Then the elliptic curve

y^2 = x(x - a^p)(x + b^p)

of discriminant

\Delta = \frac{1}{256}(abc)^{2p}

cannot be modular. Thus, the proof of the Taniyama–Shimura–Weil conjecture for this family of elliptic curves (called Hellegouarch–Frey curves) implies FLT. The proof of the link between these two statements, based on an idea of Gerhard Frey (1985), is difficult and technical. It was established by Kenneth Ribet in 1987.[13]

Integral points

This section is concerned with points P = (x, y) of E such that x is an integer.[14] The following theorem is due to C. L. Siegel: the set of points P = (x, y) of E(Q) such that x is an integer is finite. This theorem can be generalized to points whose x coordinate has a denominator divisible only by a fixed finite set of prime numbers.

The theorem can be formulated effectively. For example,[15] if the Weierstrass equation of E has integer coefficients bounded by a constant H, the coordinates (x, y) of a point of E with both x and y integer satisfy:

\max (|x|, |y|) < \exp\left(\left[10^6H\right]^ & r \text{ even} \end{cases}
Set of affine points of elliptic curve y2 = x3x over finite field F71.

The Sato–Tate conjecture is a statement about how the error term \scriptstyle 2\sqrt{q} in Hasse's theorem varies with the different primes q, if you take an elliptic curve E over Q and reduce it modulo q. It was proven (for almost all such curves) in 2006 due to the results of Taylor, Harris and Shepherd-Barron,[21] and says that the error terms are equidistributed.

Elliptic curves over finite fields are notably applied in cryptography and for the factorization of large integers. These algorithms often make use of the group structure on the points of E. Algorithms that are applicable to general groups, for example the group of invertible elements in finite fields, F*q, can thus be applied to the group of points on an elliptic curve. For example, the discrete logarithm is such an algorithm. The interest in this is that choosing an elliptic curve allows for more flexibility than choosing q (and thus the group of units in Fq). Also, the group structure of elliptic curves is generally more complicated.

Algorithms that use elliptic curves

Elliptic curves over finite fields are used in some cryptographic applications as well as for integer factorization. Typically, the general idea in these applications is that a known algorithm which makes use of certain finite groups is rewritten to use the groups of rational points of elliptic curves. For more see also:

Alternative representations of elliptic curves

See also

Notes

  1. ^ Silverman 1986, Theorem 4.1
  2. ^ Silverman 1986, pp. 199–205
  3. ^ See also J. W. S. Cassels, Mordell's Finite Basis Theorem Revisited, Mathematical Proceedings of the Cambridge Philosophical Society 100, 3–41 and the comment of A. Weil on the genesis of his work: A. Weil, Collected Papers, vol. 1, 520–521.
  4. ^ Dujella, Andrej. "History of elliptic curves rank records". Retrieved 13 May 2014. 
  5. ^ Silverman 1986, Theorem 7.5
  6. ^ Silverman 1986, Remark 7.8 in Ch. VIII
  7. ^ The definition is formal, the exponential of this power series without constant term denotes the usual development.
  8. ^ Koblitz 1993
  9. ^ D. R. Heath-Brown, The average analytic rank of elliptic curves, Duke Mathematical Journal 122–3, 591–623 (2004).
  10. ^ For the calculations, see for example D. Zagier, « Modular points, modular curves, modular surfaces and modular forms », Lecture Notes in Mathematics 1111, Springer, 1985, 225–248.
  11. ^ A synthetic presentation (in French) of the main ideas can be found in this Bourbaki article of Jean-Pierre Serre. For more details see Hellegouarch 2001
  12. ^ D. Zagier, « Modular points, modular curves, modular surfaces and modular forms », Lecture Notes in Mathematics 1111, Springer, 1985, 225–248.
  13. ^ See the survey of K. Ribet «From the Taniyama–Shimura conjecture to Fermat's Last Theorem», Annales de la Faculté des sciences de Toulouse 11 (1990), 116–139.
  14. ^ Silverman 1986, Chapter IX
  15. ^ Silverman 1986, Theorem IX.5.8., due to Baker.
  16. ^ T. Nagell, L'analyse indéterminée de degré supérieur, Mémorial des sciences mathématiques 39, Paris, Gauthier-Villars, 1929, pp. 56–59.
  17. ^ Siksek, Samir (1995), Descents on Curves of Genus I, Ph.D. thesis, University of Exeter, pp. 16–17 .
  18. ^  
  19. ^ See Koblitz 1994, p. 158
  20. ^ Koblitz 1994, p. 160
  21. ^ Harris, M.; Shepherd-Barron, N.; Taylor, R. (2010). "A family of Calabi–Yau varieties and potential automorphy".  

References

Serge Lang, in the introduction to the book cited below, stated that "It is possible to write endlessly on elliptic curves. (This is not a threat.)" The following short list is thus at best a guide to the vast expository literature available on the theoretical, algorithmic, and cryptographic aspects of elliptic curves.

External links

  • Hazewinkel, Michiel, ed. (2001), "Elliptic curve",  
  • The Mathematical Atlas: 14H52 Elliptic Curves
  • Weisstein, Eric W., "Elliptic Curves", MathWorld.
  • The Arithmetic of elliptic curves from PlanetMath
  • Three Fermat Trails to Elliptic Curves, Ezra Brown, The College Mathematics Journal, Vol. 31 (2000), pp. 162–172, winner of the MAA writing prize the George Pólya Award.
  • Matlab code for implicit function plotting – Can be used to plot elliptic curves.
  • Interactive introduction to elliptic curves and elliptic curve cryptography with SAGE
  • Geometric Elliptic Curve Model(Java-Applet drawing curves)
  • Interactive elliptic curve over R and over Zp - Web application that requires HTML5 capable browser.
  • Comprehensive database of Elliptic Curves over Q

This article incorporates material from Isogeny on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.