General algebraic systems Definition
Quasi-identity
Builds on Term algebraIdentity
Definition
Let be an algebraic signature and let be a set of variables. A quasi-identity of type is an expression where and are terms of type over . A -algebra satisfies this quasi-identity if every assignment with for all also has . Here denotes the value of the term in under .
Remarks
A quasi-identity with is an identity .
Example: the right cancellation law is satisfied by every group. Indeed, if in a group, then multiplying on the right by gives .
Non-example: the monoid does not satisfy this quasi-identity. The assignment , , satisfies the hypothesis but not the conclusion .
In first-order terms, a quasi-identity stands for the universal sentence . Another example is , which a group satisfies exactly when it has no element of order . This property cannot be expressed by identities, since the class of such groups is not closed under quotients: the additive group has it, and its quotient does not.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Identity concept
- Term algebra concept
- Quasi-identity definition
Further reading
About this page
| Tag | 64VN7KYGHK |
|---|---|
| URI | m2://64VN7KYGHK |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08C15, 03C52 |
| Defines | Quasi-identity |
| Uses | Term algebra, Identity |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (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.