Weakly diagonal algebras and definable principal congruences (Q861595): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s00012-006-1948-2 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00012-006-1948-2 / rank
 
Normal rank

Latest revision as of 05:53, 10 December 2024

scientific article
Language Label Description Also known as
English
Weakly diagonal algebras and definable principal congruences
scientific article

    Statements

    Weakly diagonal algebras and definable principal congruences (English)
    0 references
    0 references
    0 references
    29 January 2007
    0 references
    An algebra is called minimal if it has no proper subalgebras. An algebra \(A\) is named weakly diagonal if every non-empty subuniverse of \(A\times A\) contains the graph of some automorphism of \(A\). The authors state that finite weakly diagonal algebras are precisely the largest minimal algebras of the varieties they generate. Then it is shown how this fact simplifies the study of varieties generated by a finite minimal algebra. Applications to the theory of affine complete varieties: (i) affine complete varieties of finite type have definable principal congruences (DPC); (ii) arithmetical affine complete varieties of finite type have equationally definable principal congruences (EDPC).
    0 references
    minimal algebra
    0 references
    affine complete varieties
    0 references
    definable principal congruences
    0 references
    0 references

    Identifiers