Search results
Results From The WOW.Com Content Network
There is a map from a curve to its dual, sending each point to the point dual to its tangent line. If C is algebraic then so is its dual and the degree of the dual is known as the class of the original curve. The equation of the dual of C, given in line coordinates, is known as the tangential equation of C.
This page was last edited on 2 December 2024, at 16:34 (UTC).; Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply.
These sets can be used to define a plane dual structure. Interchange the role of "points" and "lines" in C = (P, L, I) to obtain the dual structure. C ∗ = (L, P, I ∗), where I ∗ is the converse relation of I. C ∗ is also a projective plane, called the dual plane of C. If C and C ∗ are isomorphic, then C is called self-dual.
The Abel–Jacobi theorem implies that the Albanese variety of a compact complex curve (dual of holomorphic 1-forms modulo periods) is isomorphic to its Jacobian variety (divisors of degree 0 modulo equivalence). For higher-dimensional compact projective varieties the Albanese variety and the Picard variety are dual but need not be isomorphic.
In mathematics, a dual abelian variety can be defined from an abelian variety A, defined over a field k. A 1-dimensional abelian variety is an elliptic curve , and every elliptic curve is isomorphic to its dual, but this fails for higher-dimensional abelian varieties, so the concept of dual becomes more interesting in higher dimensions.
To an abelian variety A over a field k, one associates a dual abelian variety (over the same field), which is the solution to the following moduli problem. A family of degree 0 line bundles parametrised by a k -variety T is defined to be a line bundle L on A × T {\displaystyle A\times T} such that
In Euclidean and projective geometry, five points determine a conic (a degree-2 plane curve), just as two (distinct) points determine a line (a degree-1 plane curve).There are additional subtleties for conics that do not exist for lines, and thus the statement and its proof for conics are both more technical than for lines.
The cube and regular octahedron are dual graphs of each other. According to Steinitz's theorem, every polyhedral graph (the graph formed by the vertices and edges of a three-dimensional convex polyhedron) must be planar and 3-vertex-connected, and every 3-vertex-connected planar graph comes from a convex polyhedron in this way.