Math 2.0

Group theory and generalizations Definition

Cayley table

Builds on Binary operation

Definition

Let S={a1,…,an}S = \{a_1, \ldots, a_n\} be a finite set with nn elements, listed in a fixed order, and let ∗\ast be a binary operation on SS. The Cayley table of (S,∗)(S, \ast) is the n×nn \times n table whose rows and columns are labelled a1,…,ana_1, \ldots, a_n. The entry in row ii and column jj is ai∗aja_i \ast a_j.

Remarks

The operation is commutative exactly when the table is symmetric about its main diagonal. In the Cayley table of a finite group, each element occurs exactly one time in each row and one time in each column. Thus the Cayley table of a finite group is a Latin square.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binary operation definition
  2. Cayley table definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Cayley_table, Structure and layout
  2. Web https://en.wikipedia.org/wiki/Cayley_table, Properties and uses
About this page
Tag0E4WH0R7HG
URIm2://0E4WH0R7HG
Kinddefinition
WritingW1 stated
MSC20A05
DefinesCayley table
UsesBinary operation

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.