|
Scissors-congruent
The third of Hilbert's problems, Hilbert's list of mathematical problems, presented in 1900, was the first to be solved. The problem is related to the following question: given any two polyhedron, polyhedra of equal volume, is it always possible to cut the first into finitely many polyhedral pieces which can be reassembled to yield the second? Based on earlier writings by Carl Friedrich Gauss, David Hilbert conjectured that this is not always possible. This was confirmed within the year by his student Max Dehn, who proved that the answer in general is "no" by producing a counterexample. The answer for the analogous question about polygons in 2 dimensions is "yes" and had been known for a long time; this is the Wallace–Bolyai–Gerwien theorem. Unknown to Hilbert and Dehn, Hilbert's third problem was also proposed independently by Władysław Kretkowski for a math contest of 1882 by the Academy of Arts and Sciences of Kraków, and was solved by Ludwik Birkenmajer, Ludwik Antoni B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wallace–Bolyai–Gerwien Theorem
In geometry, the Wallace–Bolyai–Gerwien theorem, named after William Wallace (mathematician), William Wallace, Farkas Bolyai and P. Gerwien, is a theorem related to Dissection problem, dissections of polygons. It answers the question when one polygon can be formed from another by cutting it into a finite number of pieces and recomposing these by Translation (geometry), translations and rotations. The Wallace–Bolyai–Gerwien theorem states that this can be done if and only if two polygons have the same area. William Wallace (mathematician), Wallace had proven the same result already in 1807. According to other sources, Bolyai and Gerwien had independently proved the theorem in 1833 and 1835, respectively. Formulation There are several ways in which this theorem may be formulated. The most common version uses the concept of "equidecomposability" of polygons: two polygons are equidecomposable if they can be split into finite set, finitely many triangles that only differ by ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tetrahedron
In geometry, a tetrahedron (: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular Face (geometry), faces, six straight Edge (geometry), edges, and four vertex (geometry), vertices. The tetrahedron is the simplest of all the ordinary convex polytope, convex polyhedra. The tetrahedron is the three-dimensional case of the more general concept of a Euclidean geometry, Euclidean simplex, and may thus also be called a 3-simplex. The tetrahedron is one kind of pyramid (geometry), pyramid, which is a polyhedron with a flat polygon base and triangular faces connecting the base to a common point. In the case of a tetrahedron, the base is a triangle (any of the four faces can be considered the base), so a tetrahedron is also known as a "triangular pyramid". Like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. It has two such net (polyhedron), nets. For any tetrahedron there exists a sphere (called th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cube And Prism From Two Bricks
A cube or regular hexahedron is a three-dimensional solid object in geometry, which is bounded by six congruent square faces, a type of polyhedron. It has twelve congruent edges and eight vertices. It is a type of parallelepiped, with pairs of parallel opposite faces, and more specifically a rhombohedron, with congruent edges, and a rectangular cuboid, with right angles between pairs of intersecting faces and pairs of intersecting edges. It is an example of many classes of polyhedra: Platonic solid, regular polyhedron, parallelohedron, zonohedron, and plesiohedron. The dual polyhedron of a cube is the regular octahedron. The cube can be represented in many ways, one of which is the graph known as the cubical graph. It can be constructed by using the Cartesian product of graphs. The cube is the three-dimensional hypercube, a family of polytopes also including the two-dimensional square and four-dimensional tesseract. A cube with unit side length is the canonical unit of volume in t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cavalieri's Principle
In geometry, Cavalieri's principle, a modern implementation of the method of indivisibles, named after Bonaventura Cavalieri, is as follows: * 2-dimensional case: Suppose two regions in a plane are included between two parallel lines in that plane. If every line parallel to these two lines intersects both regions in line segments of equal length, then the two regions have equal areas. * 3-dimensional case: Suppose two regions in three-space (solids) are included between two parallel planes. If every plane parallel to these two planes intersects both regions in cross section (geometry), cross-sections of equal area, then the two regions have equal volumes. Today Cavalieri's principle is seen as an early step towards integral calculus, and while it is used in some forms, such as its generalization in Fubini's theorem and layer cake representation, results using Cavalieri's principle can often be shown more directly via integration. In the other direction, Cavalieri's principle gre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quotient Space (linear Algebra)
In linear algebra, the quotient of a vector space V by a subspace N is a vector space obtained by "collapsing" N to zero. The space obtained is called a quotient space and is denoted V/N (read "V mod N" or "V by N"). Definition Formally, the construction is as follows. Let V be a vector space over a field \mathbb, and let N be a subspace of V. We define an equivalence relation \sim on V by stating that x \sim y iff . That is, x is related to y if and only if one can be obtained from the other by adding an element of N. This definition implies that any element of N is related to the zero vector; more precisely, all the vectors in N get mapped into the equivalence class of the zero vector. The equivalence class – or, in this case, the coset – of x is defined as : := \ and is often denoted using the shorthand = x + N. The quotient space V/N is then defined as V/_\sim, the set of all equivalence classes induced by \sim on V. Scalar multiplication and addition are defin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Number
In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every real number can be almost uniquely represented by an infinite decimal expansion. The real numbers are fundamental in calculus (and in many other branches of mathematics), in particular by their role in the classical definitions of limits, continuity and derivatives. The set of real numbers, sometimes called "the reals", is traditionally denoted by a bold , often using blackboard bold, . The adjective ''real'', used in the 17th century by René Descartes, distinguishes real numbers from imaginary numbers such as the square roots of . The real numbers include the rational numbers, such as the integer and the fraction . The rest of the real numbers are called irrational numbers. Some irrational numbers (as well as all the rationals) a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tensor Product
In mathematics, the tensor product V \otimes W of two vector spaces V and W (over the same field) is a vector space to which is associated a bilinear map V\times W \rightarrow V\otimes W that maps a pair (v,w),\ v\in V, w\in W to an element of V \otimes W denoted . An element of the form v \otimes w is called the tensor product of v and w. An element of V \otimes W is a tensor, and the tensor product of two vectors is sometimes called an ''elementary tensor'' or a ''decomposable tensor''. The elementary tensors span V \otimes W in the sense that every element of V \otimes W is a sum of elementary tensors. If bases are given for V and W, a basis of V \otimes W is formed by all tensor products of a basis element of V and a basis element of W. The tensor product of two vector spaces captures the properties of all bilinear maps in the sense that a bilinear map from V\times W into another vector space Z factors uniquely through a linear map V\otimes W\to Z (see the section below ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cube
A cube or regular hexahedron is a three-dimensional space, three-dimensional solid object in geometry, which is bounded by six congruent square (geometry), square faces, a type of polyhedron. It has twelve congruent edges and eight vertices. It is a type of parallelepiped, with pairs of parallel opposite faces, and more specifically a rhombohedron, with congruent edges, and a rectangular cuboid, with right angles between pairs of intersecting faces and pairs of intersecting edges. It is an example of many classes of polyhedra: Platonic solid, regular polyhedron, parallelohedron, zonohedron, and plesiohedron. The dual polyhedron of a cube is the regular octahedron. The cube can be represented in many ways, one of which is the graph known as the cubical graph. It can be constructed by using the Cartesian product of graphs. The cube is the three-dimensional hypercube, a family of polytopes also including the two-dimensional square and four-dimensional tesseract. A cube with 1, unit s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dehn Invariant
In geometry, the Dehn invariant is a value used to determine whether one polyhedron can be cut into pieces and reassembled (" dissected") into another, and whether a polyhedron or its dissections can tile space. It is named after Max Dehn, who used it to solve Hilbert's third problem by proving that certain polyhedra with equal volume cannot be dissected into each other. Two polyhedra have a dissection into polyhedral pieces that can be reassembled into either one, if and only if their volumes and Dehn invariants are equal. Having Dehn invariant zero is a necessary (but not sufficient) condition for being a space-filling polyhedron, and a polyhedron can be cut up and reassembled into a space-filling polyhedron if and only if its Dehn invariant is zero. The Dehn invariant of a self-intersection-free flexible polyhedron is invariant as it flexes. Dehn invariants are also an invariant for dissection in higher dimensions, and (with volume) a complete invariant in four dimensions. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Converse (logic)
In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the Material conditional, implication ''P'' → ''Q'', the converse is ''Q'' → ''P''. For the categorical proposition ''All S are P'', the converse is ''All P are S''. Either way, the truth of the converse is generally independent from that of the original statement.Robert Audi, ed. (1999), ''The Cambridge Dictionary of Philosophy'', 2nd ed., Cambridge University Press: "converse". Implicational converse Let ''S'' be a statement of the form ''P implies Q'' (''P'' → ''Q''). Then the ''converse'' of ''S'' is the statement ''Q implies P'' (''Q'' → ''P''). In general, the truth of ''S'' says nothing about the truth of its converse, unless the Antecedent (logic), antecedent ''P'' and the consequent ''Q'' are logically equivalent. For example, consider the true statement "If I am a human, then I am mortal." The converse of that stateme ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trisecting The Angle
Angle trisection is a classical problem of straightedge and compass construction of ancient Greek mathematics. It concerns construction of an angle equal to one third of a given arbitrary angle, using only two tools: an unmarked straightedge and a compass. In 1837, Pierre Wantzel proved that the problem, as stated, is impossible to solve for arbitrary angles. However, some special angles can be trisected: for example, it is trivial to trisect a right angle. It is possible to trisect an arbitrary angle by using tools other than straightedge and compass. For example, neusis construction, also known to ancient Greeks, involves simultaneous sliding and rotation of a marked straightedge, which cannot be achieved with the original tools. Other techniques were developed by mathematicians over the centuries. Because it is defined in simple terms, but complex to prove unsolvable, the problem of angle trisection is a frequent subject of pseudomathematical attempts at solution by naive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doubling The Cube
Doubling the cube, also known as the Delian problem, is an ancient geometry, geometric problem. Given the Edge (geometry), edge of a cube, the problem requires the construction of the edge of a second cube whose volume is double that of the first. As with the related problems of squaring the circle and trisecting the angle, doubling the cube is now known to be impossible to construct by using only a compass and straightedge, but even in ancient times solutions were known that employed other methods. According to Eutocius, Archytas was the first to solve the problem of doubling the cube (the so-called Delian problem) with an ingenious geometric construction. The nonexistence of a compass-and-straightedge solution was finally proven by Pierre Wantzel in 1837. In algebraic terms, doubling a unit cube requires the construction of a line segment of length , where ; in other words, , the cube root of two. This is because a cube of side length 1 has a volume of , and a cube of twice tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
