On free, projective, and strongly flat acts (Q1073191): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Injective Envelope of S-Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable and Injective <i>S</i>‐systems with Zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projectivity of acts and Morita equivalence of monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3314059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of monoids by torsion-free, flat, projective, and free acts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4123496 / rank
 
Normal rank

Revision as of 12:24, 17 June 2024

scientific article
Language Label Description Also known as
English
On free, projective, and strongly flat acts
scientific article

    Statements

    On free, projective, and strongly flat acts (English)
    0 references
    0 references
    0 references
    1986
    0 references
    The homological classification of monoids is considered. Theorem: All flat left S-acts (injective cogenerators, all cofree, all injective left S-acts) are strongly flat iff \(S=\{1\}\). Theorem: All projective generators in S-Act are free iff any eS, \(e^ 2=e\in S\), containing a left invertible element can be generated by a left invertible element. All terms have their usual categorical meaning, a left S-act M is called strongly flat if tensoring by M preserves equalizers and pullbacks.
    0 references
    monoids
    0 references
    flat left S-acts
    0 references
    injective cogenerators
    0 references
    injective left S-acts
    0 references
    strongly flat
    0 references
    projective generators
    0 references
    left invertible element
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references