The tag has no wiki summary.

learn more… | top users | synonyms

3
votes
1answer
175 views

Can ordinary schemes be described as sheves of algebras/models for a certain Lawvere theory?

Consider the definition of a $\mathcal{C}^{\infty}$-scheme given in Dominique Joyce's "Algebraic geometry over C-infty rings". As far as I uderstand (not being an expert either in C-infty rings nor in ...
13
votes
3answers
1k views

Relation between monads, operads and algebraic theories

I've begun to interest in algebraic theories and their categorical models: in particular monads, generalized multicategories and operads, lawvere theories and their generalization. Is there any ...
3
votes
2answers
1k views

Why Lawvere theories have finite products? and more

According to Wikipedia, a Lawvere theory consists of a small category $L$ with (strictly associative) finite products and a strict identity-on-objects functor $I:\aleph_0^\text{op}\rightarrow L$ ...
3
votes
5answers
894 views

Defining 'free monoid' without Nat?

Is there a definition of what is a 'free monoid' which does not pre-suppose that the natural numbers has already been defined? The definitions that I have been able to track down all use the natural ...
4
votes
1answer
364 views

Higher-order preservation theorems?

The Łos-Tarski preservation theorem states that a set of formulas $F$ of first-order language $L$ is preserved under substructures for models of theory $T$ in $L$ precisely when $F$ is equivalent ...
5
votes
3answers
843 views

Monad arising from operad

It's known that from every operad arises a cartesian monad whose algebras are the algebras for the operad. Leinster proved that there are different operads from which arise the same monad, in this way ...
5
votes
1answer
221 views

Do plain functors out of monoidal categories factor into a nontrivial monoidal part and a plain part?

Given symmetric monoidal closed categories $C, D$, a symmetric monoidal (not closed!) functor $F:C\to D$ factors into two parts: the first is a symmetric monoidal closed functor from $C$ to a ...
2
votes
2answers
182 views

Of what kind of complemented bounded poset are the structures in my quasi-variety?

I feel that my question is very basic, but, somewhat suprisingly, nobody was able to give me an answer so far: Let $\mathbf{M} := \langle \{ 0,1 \}, 0, 1, \leq, \neg \rangle$ be the structure with ...
5
votes
0answers
817 views

Undecidability degree of some elementary theories (two equivalence relations, …)

I have a question about some results in the paper I. A. Lavrov. Effective inseparability of the sets of identically true formulae and finitely refutable formulae for certain theories (in Russian). ...
6
votes
3answers
835 views

Does “finitely presented” mean “always finitely presented”, considered in general

I'm wondering about the question, "If we have a finitely presented __, is it necessarily finitely presented with respect to any finite generating set for it?" I know this is true for groups and for ...
7
votes
1answer
489 views

Does ⋄ generate all De Morgan algebras?

(Asked by Nathaniel Hellerstein on the Q&A board at JMM) This question is about De Morgan algebras (see also Wikipedia), which are something like Boolean algebras, but with a different weaker ...
6
votes
5answers
519 views

Binary operations compatible with the usual order on the reals

An officemate passes along the following natural-seeming question: Say that a binary operation $\oplus$ is compatible with the usual order $\leq$ on $\mathbb{R}$ if for any $w, x, y, z$ in ...
3
votes
2answers
545 views

Is the decomposition of an algebra into irreducible components essentially unique?

We consider finite algebras for a given signature, in the sense of universal algebra (for example, they might be groups, rings, or lattices). An algebra $A$ is irreducible when $A \cong B \times C$ ...
1
vote
2answers
841 views

What is a semigroup or, what do I do with that associativity proof?

Mathematically, I know what a semigroup is: It is a set S along with an associative binary operation $* : S \times S \rightarrow S$. So far, so good. From a computational perspective, one can ...
7
votes
1answer
579 views

Lattice-ordered commutative monoids

By a lattice-ordered monoid, I mean a structure $(A,0,{+},{\vee},{\wedge})$ such that $(A,0,{+})$ is a (not necessarily commutative) monoid, $(A,{\vee},{\wedge})$ is a lattice, and the two ...
3
votes
2answers
236 views

What do you call a lattice whose meet operation preserves disjointness of subsets?

To make my question more precise and compact (and probably more intuitive), let me define the following: A subset $S$ of a lattice is mutually disjoint if for each $x \in S$, $\bigvee(S - \lbrace x ...
9
votes
2answers
743 views

Free division rings?

Does it make sense to talk about, say, the free division ring on 2 generators? If so, does the free division ring on countably many generators embed into the free division ring on two generators?
0
votes
1answer
147 views

How to define the action of $U(G)$ in this situation?

The usual action of $fg$ on $u⊗v$ , where $f,g$ are elements in the Universal Enveloping Algebra $U(G)$ of a Lie algebra $G$ and $u,v$ are elements of a representation $V$ of $G$, is given by ...
4
votes
2answers
565 views

Is there a notion of congruence relation for essentially algebraic structures?

In universal algebra there is the notion of congruence relation: Consider a (1-sorted) algebraic structure, i.e. a set $A$ with a bunch of finitary operations $f_i$ satisfying equations. A congruence ...
1
vote
4answers
760 views

Is monomorphism going in both directions sufficient for isomorphism?

In category theory, it seems that a monomorphism from $A$ to $B$ and one from $B$ to $A$ should be enough to guarantee isomorphy, but it doesn't seem to be so. (If I'm right then there's something ...
8
votes
2answers
608 views

Right actions of operads and monads

Given an operad $A$, there is an associated monad $M_A$ given by $M_A(X) = \coprod_n A(n) \otimes X^{\otimes n}$ such that being an $A$-algebra and being an algebra over the monad $M_A$ is the same ...
2
votes
1answer
453 views

Higher-order, multi-sorted, non purely equational version of universal algebra ?

I have been looking around, unsuccessfully, for generalizations of universal algebra based on higher-order logic (rather than first order) and where the relations are not purely equational. ...
3
votes
2answers
265 views

Terminology: Name for a homomorphism from the free object?

Is there a standard name for taking a homomorphism from the free object over an algebraic structure? Roughly speaking, this should amount to evaluation of any element of the free object under the ...
1
vote
1answer
485 views

Coequalizer in the category of primitive recursive functions

What does a coequalizer in the category of primitive recursive functions look like? I know that in Set, a coequalizer is a minimum congruence but...what is it in particular in the category of ...
4
votes
2answers
424 views

Is every lattice the fixed-point set of an order endomorphism of ⋄^n?

(Asked by Nathaniel Hellerstein on the Q&A board at JMM) Let ⋄ be the 4 element lattice τ / \ i j \ / f Is every lattice isomorphic to the fixed point lattice of some ...