|
Loop Space
In topology, a branch of mathematics, the loop space Ω''X'' of a pointed topological space ''X'' is the space of (based) loops in ''X'', i.e. continuous pointed maps from the pointed circle ''S''1 to ''X'', equipped with the compact-open topology. Two loops can be multiplied by concatenation. With this operation, the loop space is an ''A''∞-space. That is, the multiplication is homotopy-coherently associative. The set of path components of Ω''X'', i.e. the set of based-homotopy equivalence classes of based loops in ''X'', is a group, the fundamental group ''π''1(''X''). The iterated loop spaces of ''X'' are formed by applying Ω a number of times. There is an analogous construction for topological spaces without basepoint. The free loop space of a topological space ''X'' is the space of maps from the circle ''S''1 to ''X'' with the compact-open topology. The free loop space of ''X'' is often denoted by \mathcalX. As a functor, the free loop space construction is righ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topology
In mathematics, topology (from the Greek language, Greek words , and ) is concerned with the properties of a mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformations, such as Stretch factor, stretching, Twist (mathematics), twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself. A topological space is a set (mathematics), set endowed with a structure, called a ''Topology (structure), topology'', which allows defining continuous deformation of subspaces, and, more generally, all kinds of continuity (mathematics), continuity. Euclidean spaces, and, more generally, metric spaces are examples of a topological space, as any distance or metric defines a topology. The deformations that are considered in topology are homeomorphisms and homotopy, homotopies. A property that is invariant under such deformations is a topological property. Basic exampl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Right Adjoint
In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e., constructions of objects having a certain universal property), such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology. By definition, an adjunction between categories \mathcal and \mathcal is a pair of functors (assumed to be covariant) :F: \mathcal \rightarrow \mathcal and G: \mathcal \rightarrow \mathcal and, for all objects X in \mathcal and Y in \mathcal a bijection between the respective morphism ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Loop
"Free Loop (One Night Stand)" (titled as "Free Loop" on ''Daniel Powter'') is a song written by Canadian singer Daniel Powter. It was his second single and the follow-up to his successful song, " Bad Day". In the United Kingdom, WEA failed to realize the single was deemed ineligible to chart since "Bad Day" was included as B-side whilst still being in the UK top 40 at the time. In the US, it did not chart on the ''Billboard'' Hot 100, but it did reach the top 30 of the ''Billboard'' Adult Contemporary chart. The song was featured in Cheetah Mobile's 2016 iOS/Android app Piano Tiles 2. It was also used in a 2007 advertisement showcasing the Ford I-Max in Taiwan. Music video The video, directed by Marc Webb, who also directed the music videos for " Bad Day" and "Lie to Me," shows a young Daniel Powter starting at a piano in a music store and puts his fingers on the window and magically plays the piano. The scene then cuts to an adult version of Powter, who is now able to buy th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eilenberg–MacLane Space
In mathematics, specifically algebraic topology, an Eilenberg–MacLane spaceSaunders Mac Lane originally spelt his name "MacLane" (without a space), and co-published the papers establishing the notion of Eilenberg–MacLane spaces under this name. (See e.g. ) In this context it is therefore conventional to write the name without a space. is a topological space with a single nontrivial homotopy group. Let ''G'' be a group and ''n'' a positive integer. A connected topological space ''X'' is called an Eilenberg–MacLane space of type K(G,n), if it has ''n''-th homotopy group \pi_n(X) isomorphic to ''G'' and all other homotopy groups trivial. If n > 1 then ''G'' must be abelian. Such a space exists, is a CW-complex, and is unique up to a weak homotopy equivalence, therefore any such space is often just called K(G,n). The name is derived from Samuel Eilenberg and Saunders Mac Lane, who introduced such spaces in the late 1940s. As such, an Eilenberg–MacLane space is a special k ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homotopy Group
In mathematics, homotopy groups are used in algebraic topology to classify topological spaces. The first and simplest homotopy group is the fundamental group, denoted \pi_1(X), which records information about loops in a space. Intuitively, homotopy groups record information about the basic shape, or ''holes'', of a topological space. To define the ''n''-th homotopy group, the base-point-preserving maps from an ''n''-dimensional sphere (with base point) into a given space (with base point) are collected into equivalence classes, called homotopy classes. Two mappings are homotopic if one can be continuously deformed into the other. These homotopy classes form a group, called the ''n''-th homotopy group, \pi_n(X), of the given space ''X'' with base point. Topological spaces with differing homotopy groups are never equivalent ( homeomorphic), but topological spaces that homeomorphic have the same homotopy groups. The notion of homotopy of paths was introduced by Camille Jordan. I ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homeomorphism
In the mathematical field of topology, a homeomorphism, topological isomorphism, or bicontinuous function is a bijective and continuous function between topological spaces that has a continuous inverse function. Homeomorphisms are the isomorphisms in the category of topological spaces—that is, they are the mappings that preserve all the topological properties of a given space. Two spaces with a homeomorphism between them are called homeomorphic, and from a topological viewpoint they are the same. The word ''homeomorphism'' comes from the Greek words '' ὅμοιος'' (''homoios'') = similar or same and '' μορφή'' (''morphē'') = shape or form, introduced to mathematics by Henri Poincaré in 1895. Very roughly speaking, a topological space is a geometric object, and the homeomorphism is a continuous stretching and bending of the object into a new shape. Thus, a square and a circle are homeomorphic to each other, but a sphere and a torus are not. However, this desc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Transformation
In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure (i.e., the composition of morphisms) of the categories involved. Hence, a natural transformation can be considered to be a "morphism of functors". Informally, the notion of a natural transformation states that a particular map between functors can be done consistently over an entire category. Indeed, this intuition can be formalized to define so-called functor categories. Natural transformations are, after categories and functors, one of the most fundamental notions of category theory and consequently appear in the majority of its applications. Definition If F and G are functors between the categories C and D , then a natural transformation \eta from F to G is a family of morphisms that satisfies two requirements. # The natural transformation must associate, to every object X in C, a morphism \eta_X : F ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Suspension (topology)
In topology, a branch of mathematics, the suspension of a topological space ''X'' is intuitively obtained by stretching ''X'' into a cylinder and then collapsing both end faces to points. One views ''X'' as "suspended" between these end points. The suspension of ''X'' is denoted by ''SX'' or susp(''X''). There is a variation of the suspension for pointed space, which is called the reduced suspension and denoted by Σ''X''. The "usual" suspension ''SX'' is sometimes called the unreduced suspension, unbased suspension, or free suspension of ''X'', to distinguish it from Σ''X.'' Free suspension The (free) suspension SX of a topological space X can be defined in several ways. 1. SX is the quotient space (X \times ,1/(X\times \, X\times \). In other words, it can be constructed as follows: * Construct the cylinder X \times ,1/math>. * Consider the entire set X\times \ as a single point ("glue" all its points together). * Consider the entire set X\times \ as a single point ("g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eckmann–Hilton Duality
In the mathematical disciplines of algebraic topology and homotopy theory, Eckmann–Hilton duality in its most basic form, consists of taking a given diagram for a particular concept and reversing the direction of all arrows, much as in category theory with the idea of the opposite category. A significantly deeper form argues that the fact that the dual notion of a limit is a colimit allows us to change the Eilenberg–Steenrod axioms for homology to give axioms for cohomology. It is named after Beno Eckmann and Peter Hilton. Discussion An example is given by currying, which tells us that for any object X, a map X \times I \to Y is the same as a map X \to Y^I, where Y^I is the exponential object, given by all maps from I to Y . In the case of topological spaces, if we take I to be the unit interval, this leads to a duality between X \times I and Y^I, which then gives a duality between the reduced suspension \Sigma X, which is a quotient of X \times I, and th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hom Functor
In mathematics, specifically in category theory, hom-sets (i.e. sets of morphisms between objects) give rise to important functors to the category of sets. These functors are called hom-functors and have numerous applications in category theory and other branches of mathematics. Formal definition Let ''C'' be a locally small category (i.e. a category for which hom-classes are actually sets and not proper classes). For all objects ''A'' and ''B'' in ''C'' we define two functors to the category of sets as follows: : The functor Hom(–, ''B'') is also called the ''functor of points'' of the object ''B''. Note that fixing the first argument of Hom naturally gives rise to a covariant functor and fixing the second argument naturally gives a contravariant functor. This is an artifact of the way in which one must compose the morphisms. The pair of functors Hom(''A'', –) and Hom(–, ''B'') are related in a natural manner. For any pair of morphisms ''f'' : ''B'' → ''B'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Currying
In mathematics and computer science, currying is the technique of translating the evaluation of a function that takes multiple arguments into evaluating a sequence of functions, each with a single argument. For example, currying a function f that takes three arguments creates a nested unary function g, so that the code :\textx=f(a,b,c) gives x the same value as the code : \begin \texth = g(a) \\ \texti = h(b) \\ \textx = i(c), \end or called in sequence, :\textx = g(a)(b)(c). In a more mathematical language, a function that takes two arguments, one from X and one from Y, and produces outputs in Z, by currying is translated into a function that takes a single argument from X and produces as outputs ''functions'' from Y to Z. This is a natural one-to-one correspondence between these two types of functions, so that the sets together with functions between them form a Cartesian closed category. The currying of a function with more than two arguments can then be defined by induction. Cur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
