Join (topology)

In topology, a field of mathematics, the join of two topological spaces A and B, often denoted by , is defined to be the quotient space

where I is the interval [0, 1] and R is the equivalence relation generated by

At the endpoints, this collapses to and to .

Intuitively, is formed by taking the disjoint union of the two spaces and attaching a line segment joining every point in A to every point in B.

Properties

is homeomorphic to the reduced suspension

of the smash product. Consequently, since is contractible, there is a homotopy equivalence

Examples

Join

Join may refer to:

Lattice (order)

In mathematics, a lattice is one of the fundamental algebraic structures used in abstract algebra. It consists of a partially ordered set in which every two elements have a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet). An example is given by the natural numbers, partially ordered by divisibility, for which the unique supremum is the least common multiple and the unique infimum is the greatest common divisor.

Lattices can also be characterized as algebraic structures satisfying certain axiomatic identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These "lattice-like" structures all admit order-theoretic as well as algebraic descriptions.

Lattices as partially ordered sets

If (L, ≤) is a partially ordered set (poset), and S⊆L is an arbitrary subset, then an element u∈L is said to be an upper bound of S if s≤u for each s∈S. A set may have many upper bounds, or none at all. An upper bound u of S is said to be its least upper bound, or join, or supremum, if u≤x for each upper bound x of S. A set need not have a least upper bound, but it cannot have more than one. Dually, l∈L is said to be a lower bound of S if l≤s for each s∈S. A lower bound l of S is said to be its greatest lower bound, or meet, or infimum, if x≤l for each lower bound x of S. A set may have many lower bounds, or none at all, but can have at most one greatest lower bound.

Relational algebra

Relational algebra, first described by E.F. Codd while at IBM, is a family of algebras with a well-founded semantics used for modelling the data stored in relational databases, and defining queries on it.

The main application of relational algebra is providing a theoretical foundation for relational databases, particularly query languages for such databases, chief among which is SQL.

Introduction

Relational algebra received little attention outside of pure mathematics until the publication of E.F. Codd's relational model of data in 1970. Codd proposed such an algebra as a basis for database query languages. (See section Implementations.)

Five primitive operators of Codd's algebra are the selection, the projection, the Cartesian product (also called the cross product or cross join), the set union, and the set difference.

Set operators

The relational algebra uses set union, set difference, and Cartesian product from set theory, but adds additional constraints to these operators.

Topological space

In topology and related branches of mathematics, a topological space may be defined as a set of points, along with a set of neighbourhoods for each point, that satisfy a set of axioms relating points and neighbourhoods. The definition of a topological space relies only upon set theory and is the most general notion of a mathematical space that allows for the definition of concepts such as continuity, connectedness, and convergence. Other spaces, such as manifolds and metric spaces, are specializations of topological spaces with extra structures or constraints. Being so general, topological spaces are a central unifying notion and appear in virtually every branch of modern mathematics. The branch of mathematics that studies topological spaces in their own right is called point-set topology or general topology.

Definition

The utility of the notion of a topology is shown by the fact that there are several equivalent definitions of this structure. Thus one chooses the axiomatisation suited for the application. The most commonly used, and the most elegant, is that in terms of open sets, but the most intuitive is that in terms of neighbourhoods and so we give this first. Note: A variety of other axiomatisations of topological spaces are listed in the Exercises of the book by Vaidyanathaswamy.

Topology (musical ensemble)

Topology is an indie classical quintet from Australia, formed in 1997. A leading Australian new music ensemble, they perform throughout Australia and abroad and have to date released 12 albums, including one with rock/electronica band Full Fathom Five and one with contemporary ensemble Loops. They were formerly the resident ensemble at the University of Western Sydney. The group works with composers including Tim Brady in Canada, Andrew Poppy, Michael Nyman, and Jeremy Peyton Jones in the UK, and Terry Riley, Steve Reich, Philip Glass, Carl Stone, and Paul Dresher in the US, as well as many Australian composers.

In 2009, Topology won the Outstanding Contribution by an Organisation award at the Australasian Performing Right Association (APRA) Classical Music Awards for their work on the 2008 Brisbane Powerhouse Series.

Members

Bernard studied viola at the Queensland Conservatorium (B.Mus 1987) and at Michigan State University (Master of Music 1993) with John Graham and Robert Dan. He studied in summer schools with Kim Kashkashian (Aldeborough), the Alban Berg Quartet and the Kronos Quartet. While in the US, he played with the Arlington Quartet, touring the US and UK. He was a violist in the Queensland Philharmonic Orchestra from 1994-2000, and is now Associate Principal Violist of the Queensland Orchestra, playing solo parts in works such as the sixth Brandenburg Concerto. He has directed several concerts for the Queensland Philharmonic’s Off the Factory Floor chamber series.

Topology (journal)

Topology was a peer-reviewed mathematical journal covering topology and geometry. It was established in 1962 and was published by Elsevier. The last issue of Topology appeared in 2009.

Pricing dispute

On 10 August 2006, after months of unsuccessful negotiations with Elsevier about the price policy of library subscriptions, the entire editorial board of the journal handed in their resignation, effective 31 December 2006. Subsequently, two more issues appeared in 2007 with papers that had been accepted before the resignation of the editors. In early January the former editors instructed Elsevier to remove their names from the website of the journal, but Elsevier refused to comply, justifying their decision by saying that the editorial board should remain on the journal until all of the papers accepted during its tenure had been published.

In 2007 the former editors of Topology announced the launch of the Journal of Topology, published by Oxford University Press on behalf of the London Mathematical Society at a significantly lower price. Its first issue appeared in January 2008.