Heap (mathematics)

Heap (mathematics)

In abstract algebra, a heap (sometimes also called a groud) is a mathematical generalisation of a group. Informally speaking, one obtains a heap from a group by "forgetting" which element is the unit, in the same way that one can think of an affine spaces as a vector space in which one has "forgotten" which element is 0. A heap is essentially the same thing as a torsor, and the category of heaps is equivalent to the category of torsors, with morphisms given by transport of structure under group homomorphisms, but the theory of heaps emphasizes the intrinsic composition law, rather than global structures such as the geometry of bundles.

Formally, a heap is an algebraic structure consisting of a non-empty set "H" with a ternary operation denoted [x,y,z] in H which satisfies

* the para-associative law

:: [a,b,c] ,d,e] = [a, [d,c,b] ,e] = [a,b, [c,d,e] forall a,b,c,d,e in H

* the identity law

:: [a,a,x] = [x,a,a] = x forall a,x in H.

A group can be regarded as a heap under the operation [x,y,z] = xy^{-1}z . Conversely, let "H" be a heap, and choose an element "e"∈"H". The binary operation x*y = [x,e,y] makes "H" into a group with identity e and inverse x^{-1} = [e,x,e] . A heap can thus be regarded as a group in which the identity has yet to be decided.

Whereas the automorphisms of a single object form a group, the set of isomorphisms between two isomorphic objects naturally forms a heap, with the operation [f,g,h] =fg^{-1}h (here juxtaposition denotes composition of functions). This heap becomes a group once a particular isomorphism by which the two objects are to be identified is chosen.

Generalisations and related concepts

* A semiheap is para-associative but need not obey the identity law.
* An idempotent semiheap is a semiheap where [a,a,a] = a for all "a".
* A generalised heap is an idempotent semiheap where

:: [a,a, [b,b,x] = [b,b, [a,a,x] and [x,a,a] ,b,b] = [x,b,b] ,a,a] for all "a" and "b".
* A torsor is an equivalent notion to a heap which places more emphasis on the associated group. Any G-torsor X is a heap under the operation [x,y,z] =(x/y)cdot z. Conversely, if X is a heap, any x,yin X define a permutation varphi_{x,y}(z)= [x,y,z] of X. If we let G be the set of all such permutations varphi_{x,y}, then G is a group and X is a G-torsor under the natural action.

References

*cite journal
author = Vagner, V. V.
title = On the algebraic theory of coordinate atlases, II
format = In Russian
journal = Trudy Sem. Vektor. Tenzor. Anal.
volume = 14
year = 1968
pages = 229–281
id = MathSciNet | id = 0253970


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Heap — may refer to:In computer science: * heap (data structure), a tree like data structure * The heap (or free store ) is the area of memory used for dynamic memory allocationIn mathematics: *a heap (mathematics) is a generalization of a group.In… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • d-ary heap — The d ary heap or d heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2.[1][2][3] Thus, a binary heap is a 2 heap. According to Tarjan[2] and Jensen et al …   Wikipedia

  • Philosophy of mathematics — The philosophy of mathematics is the branch of philosophy that studies the philosophical assumptions, foundations, and implications of mathematics. The aim of the philosophy of mathematics is to provide an account of the nature and methodology of …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… …   Wikipedia

  • Isomorphism — In abstract algebra, an isomorphism (Greek: ἴσος isos equal , and μορφή morphe shape ) is a bijective map f such that both f and its inverse f −1 are homomorphisms, i.e., structure preserving mappings.In the more general setting of category… …   Wikipedia

  • Principal homogeneous space — In mathematics, a principal homogeneous space, or torsor, for a group G is a set X on which G acts freely and transitively. That is, X is a homogeneous space for G such that the stabilizer of any point is trivial. An analogous definition holds in …   Wikipedia

  • Affine space — In mathematics, an affine space is an abstract structure that generalises the affine geometric properties of Euclidean space. In an affine space, one can subtract points to get vectors, or add a vector to a point to get another point, but one… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”