Given a finite set G is closed under an associative product and that both cancellation laws hold in G,Then G must be a group.(adsbygoogle = window.adsbygoogle || []).push({});

I need to prove that G must be a group, I understand that for this

I only need to show that :

1) There exist the identity

2) There exist the inverse.

But while trying to do this problem , i am not able to understand how to use the fact that G is finite ?

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Finite group

Loading...

Similar Threads for Finite group | Date |
---|---|

I Notation N(H) for a subgroup | Oct 28, 2016 |

Finite field with hard discrete log for both groups | Sep 1, 2015 |

Prove that a finite set with cancellation laws is a group | Jul 22, 2015 |

Is a finite semigroup isomorphic to subsets of some group? | Jul 24, 2013 |

**Physics Forums - The Fusion of Science and Community**