definition of Wikipedia
The fundamental polygon of the projective plane.
The Möbius strip with a single edge, can be closed into a projective plane by gluing opposite open edges together.
In comparison the Klein bottle is a Möbius strip closed into a cylinder.
In mathematics, the real projective plane is an example of a compact non-orientable two-dimensional manifold, that is, a one-sided surface. It cannot be embedded in our usual three-dimensional space without intersecting itself. It has basic applications to geometry, since the common construction of the real projective plane is as the space of lines in R3 passing through the origin.
The plane is also often described topologically, in terms of a construction based on the Möbius strip: if one could glue the (single) edge of the Möbius strip to itself in the correct direction, one would obtain the projective plane. (This cannot be done in our three-dimensional space.) Equivalently, gluing a disk along the boundary of the Möbius strip gives the projective plane. Topologically, it has Euler characteristic 1, hence a demigenus (non-orientable genus, Euler genus) of 1.
Since the Möbius strip, in turn, can be constructed from a square by gluing two of its sides together, the real projective plane can thus be represented as a unit square (that is, [0,1] × [0,1] ) with its sides identified by the following equivalence relations:
as in the diagram on the right.
Topology is not concerned with flatness, and the real projective plane may be twisted up and placed in the Euclidean plane or 3-space in many different ways. Some of the more important examples are described below.
The projective plane cannot be embedded (that is without intersection) in three-dimensional Euclidean space. The proof that the projective plane does not embed in three-dimensional Euclidean space goes like this: Assume that it does embed, it would bound a compact region in three-dimensional Euclidean space by the generalized Jordan curve theorem. The outward-pointing unit normal vector field would then give an orientation of the boundary manifold, but the boundary manifold would be projective space, which is not orientable. This is a contradiction, and so our assumption that it does embed must have been false.
Consider a sphere, and let the great circles of the sphere be "lines", and let pairs of antipodal points be "points". It is easy to check that this system obeys the axioms required of a projective plane:
If we identify each point on the sphere with its antipodal point, then we get a representation of the real projective plane in which the "points" of the projective plane really are points. This means that the projective plane is the quotient space of the sphere obtained by partitioning the sphere into equivalence classes under the equivalence relation ~, where x ~ y if y = −x. This quotient space of the sphere is homeomorphic with the collection of all lines passing through the origin in R3.
The quotient map from the sphere onto the real projective plane is in fact a two sheeted (i.e. two-to-one) covering map. It follows that the fundamental group of the real projective plane is the cyclic group of order 2, i.e. integers modulo 2. One can take the loop AB from the figure above to be the generator.
Because the real projective plane covers the sphere twice, it may be represented as a hemisphere around whose rim opposite points are similarly identified.
Polyhedral examples must have at least nine faces.
Looking in the opposite direction, certain abstract regular polytopes — hemi-cube, hemi-dodecahedron, and hemi-icosahedron — can be constructed as regular figures in the projective plane; see also projective polyhedra.
Various planar (flat) projections or mappings of the projective plane have been described. In 1874 Klein described the mapping 
Central projection of the projective hemisphere onto a plane yields the usual infinite projective plane, described below.
The points in the plane can be represented by homogeneous coordinates. A point has homogeneous coordinates [x : y : z], where the coordinates [x : y : z] and [tx : ty : tz] are considered to represent the same point, for all nonzero values of t. The points with coordinates [x : y : 1] are the usual real plane, called the finite part of the projective plane, and points with coordinates [x : y : 0], called points at infinity or ideal points, constitute a line called the line at infinity. (The homogeneous coordinates [0 : 0 : 0] do not represent any point.)
The lines in the plane can also be represented by homogeneous coordinates. A projective line corresponding to the plane ax + by + c = 0 in R3 has the homogeneous coordinates (a : b : c). Thus, these coordinates have the equivalence relation (a : b : c) = (da : db : dc) for all nonzero values of d. Hence a different equation of the same line dax + dby + dc = 0 gives the same homogeneous coordinates. A point [x : y : z] lies on a line (a : b : c) if ax + by + c = 0. Therefore, lines with coordinates (a : b : c) where a, b are not both 0 correspond to the lines in the usual real plane, because they contain points that are not at infinity. The line with coordinates (0 : 0 : 1) is the line at infinity, since the only points on it are those with z = 0.
In the projective plane P2, a point x is represented by the homogeneous coordinate (x1, x2, x3). If we think of (x1, x2, x3) as a point in real space R3 with the third value of the homogeneous coordinate as a value in the z direction, then P2 can be visualized as R3.
A line in P2 can be represented by the equation ax + by + c = 0. If we treat a, b, and c as the column vector ℓ and x, y, 1 as the column vector x then the equation above can be written in matrix form as:
Using vector notation we may instead write
The equation k(xTℓ) = 0 (which k is a non-zero scalar) sweeps out a plane that goes through zero in R3 and k(x) sweeps out a ray, again going through zero. The plane and ray are subspaces in R3, which always go through zero.
In P2 the equation of a line is ax + by + c = 0 and this equation can represent a line on any plane parallel to the x, y plane by multiplying the equation by k.
If z = 1 we have a normalized homogeneous coordinate. All points that have z = 1 create a plane. Let's pretend we are looking at that plane (from a position further out along the z axis and looking back towards the origin) and there are two parallel lines drawn on the plane. From where we are standing (given our visual capabilities) we can see only so much of the plane, which we represent as the area outlined in red in the diagram. If we walk away from the plane along the z axis, (still looking backwards towards the origin), we can see more of the plane. In our field of view original points have moved. We can reflect this movement by dividing the homogeneous coordinate by a constant. In the image to the right we have divided by 2 so the z value now becomes 0.5. If we walk far enough away what we are looking at becomes a point in the distance. As we walk away we see more and more of the parallel lines. The lines will meet at a line at infinity (a line that goes through zero on the plane at z = 0). Lines on the plane when z = 0 are ideal points. The plane at z = 0 is the line at infinity.
The homogeneous point (0, 0, 0) is where all the real points go when you're looking at the plane from an infinite distance, a line on the z = 0 plane is where parallel lines intersect.
In the equation xTℓ = 0 there are two column vectors. You can keep either constant and vary the other. If we keep the point constant x and vary the coefficients ℓ we create new lines that go through the point. If we keep the coefficients constant and vary the points that satisfy the equation we create a line. We look upon x as a point because the axes we are using are x, y, and z. If we instead plotted the coefficients using axis marked a, b, c points would become lines and lines would become points. If you prove something with the data plotted on axis marked x, y, and z the same argument can be used for the data plotted on axis marked a, b, and c. That is duality.
The equation xTℓ = 0 calculates the inner product of two column vectors. The inner product of two vectors is zero if the vectors are orthogonal. To find the line between the points x1 and x2 you must find the column vector ℓ that satisfies the equations x1Tℓ = 0 and x2Tℓ = 0, that is we must find a column vector ℓ that is orthogonal to x1 and x2. In the case of P2, the cross product will find such a vector. The line joining two points is given by the equation x1 × x2. To find the intersection of two lines you look to duality. If you plot ℓ in the coefficient space you get rays. To find the point x that is orthogonal to the two rays you find the cross product. That is ℓ1 × ℓ2.
While the cross product works in P2, it is not well-defined in arbitrary dimensions. However, this pair of equations is satisfied by
The projective plane embeds into 4-dimensional Euclidean space. Consider to be the quotient of the two-sphere by the antipodal relation . Consider the function given by . This map restricts to a map whose domain is and, since it is a purely quadratic polynomial, it can be factorised to give a map . Moreover, this map is an embedding. Notice that this embedding admits a projection into which is the Roman surface.
By glueing together projective planes successively we get non-orientable surfaces of higher demigenus. The glueing process consists of cutting out a little disk from each surface and identifying (glueing) their boundary circles. Glueing two projective planes creates the Klein bottle.
The article on the fundamental polygon describes the higher non-orientable surfaces.
Dictionary and translator for handheld
New : sensagent is now available on your handheld
A windows (pop-into) of information (full-content of Sensagent) triggered by double-clicking any word on your webpage. Give contextual explanation and translation from your sites !
With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.
Improve your site content
Add new content to your site from Sensagent by XML.
Crawl products or adds
Get XML access to reach the best products.
Index images and define metadata
Get XML access to fix the meaning of your metadata.
Please, email us to describe your idea.
Lettris is a curious tetris-clone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.
Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !
Change the target language to find translations.
Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.