Rahul Sharma (Editor)

Heap (mathematics)

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In abstract algebra, a heap (sometimes also called a groud) is a mathematical generalization of a group. Informally speaking, a heap is obtained from a group by "forgetting" which element is the unit, in the same way that an affine space can be viewed as a vector space in which the 0 element has been "forgotten". 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.

Contents

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

  • the para-associative law
  • the identity law

    • A group can be regarded as a heap under the operation [ x , y , z ] = x y − 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 ] = f g − 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.

    Heap of a group

    As noted above, any group becomes a heap under the operation

    [ x , y , z ] = x y − 1 z .

    Two element heap

    Define H = { a , b } into the cyclic group group C 2 , by defining a the identity element, and b b = a . Then it produces the following heap:

    [ a , a , a ] = a , [ a , a , b ] = b , [ b , a , a ] = b , [ b , a , b ] = a , [ a , b , a ] = b , [ a , b , b ] = a , [ b , b , a ] = a , [ b , b , b ] = b .

    Heap of integers

    If x , y , z are integers, we can set [ x , y , z ] = x − y + z to produce a heap. We can then choose any integer k to be the identity of a new group on the set of integers, with the operation ∗

    x ∗ y = x + y − k

    and inverse

    x − 1 = 2 k − x .

    Heap of a groupoid with two objects

    One may generalize the notion of the heap of a group to the case of a groupoid which has two objects A and B when viewed as a category. The elements of the heap may be identified with the morphisms from A to B, such that three morphisms x, y, z define a heap operation according to:

    [ x , y , z ] = x y − 1 z .

    This reduces to the heap of a group if a particular morphism between the two objects is chosen as the identity. This intuitively relates the description of isomorphisms between two objects as a heap and the description of isomorphisms between multiple objects as a groupoid.

  • A pseudoheap or pseudogroud satisfies the partial para-associative condition
    • [ [ a , b , c ] , d , e ] = [ a , b , [ c , d , e ] ] .
  • A Malcev operation satisfies the identity law but not necessarily the para-associative law, that is, a ternary operation f on a set X satisfying the identity f ( x , x , y ) = f ( y , x , x ) = y .
  • A semiheap or semigroud is required to satisfy only the para-associative law but need not obey the identity law.
  • An idempotent semiheap is a semiheap where [ a , a , a ] = a for all a.
  • A generalised heap or generalised groud is an idempotent semiheap where

    • A semigroud is a generalised groud if the relation → defined by

    a → b ⇔ [ a , b , a ] = a

    is reflexive (idempotence) and anti-symmetric. In a generalised groud, → is an order relation.

  • A torsor is an equivalent notion to a heap that places more emphasis on the associated group. Any G -torsor X is a heap under the operation [ x , y , z ] = ( x / y ) ⋅ z . Conversely, if X is a heap, any x , y ∈ X define a permutation φ x , y ( z ) = [ x , y , z ] of X . If we let G be the set of all such permutations φ x , y , then G is a group and X is a G -torsor under the natural action.

    • References

    Heap (mathematics) Wikipedia
    (Text) CC BY-SA


    Similar Topics