Let $\mathsf{Law}$ be the category of (single-sorted) Lawvere theories. There is a forgetful functor $U : \mathsf{Law} \to \mathsf{Set}^\mathbb{N}$ that sends a Lawvere theory to its associated "signature", i.e. the functor $\mathbb{N} \to \mathsf{Set}$ that sends each $n \in \mathbb{N}$ to the set of $n$-ary operations in the Lawvere theory. I believe it is known that this functor has a left adjoint, but I have not been able to find a proof of this fact. Can someone provide the proof that $U : \mathsf{Law} \to \mathsf{Set}^\mathbb{N}$ has a left adjoint, or point me to an appropriate reference? Also, is it possible to prove this without using the equivalence between Lawvere theories and finitary monads on $\mathsf{Set}$, or the fact that any Lawvere theory has a "syntactic" presentation (i.e. can this be proved just from the categorical definition of Lawvere theory)?
2026-03-28 09:33:33.1774690413
Free Lawvere theory on a signature
115 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in CATEGORY-THEORY
- (From Awodey)$\sf C \cong D$ be equivalent categories then $\sf C$ has binary products if and only if $\sf D$ does.
- Continuous functor for a Grothendieck topology
- Showing that initial object is also terminal in preadditive category
- Is $ X \to \mathrm{CH}^i (X) $ covariant or contravariant?
- What concept does a natural transformation between two functors between two monoids viewed as categories correspond to?
- Please explain Mac Lane notation on page 48
- How do you prove that category of representations of $G_m$ is equivalent to the category of finite dimensional graded vector spaces?
- Terminal object for Prin(X,G) (principal $G$-bundles)
- Show that a functor which preserves colimits has a right adjoint
- Show that a certain functor preserves colimits and finite limits by verifying it on the stalks of sheaves
Related Questions in UNIVERSAL-ALGEBRA
- What does it mean - "to derive" operation from some existing one on a particular set?
- Question on the composition of homomorphisms
- Algebraic theories, the category Set, and natural transformations
- Subdirect product of algebras
- Subdirect products
- Can we axiomatize a field starting with the binary operations and only “equational” axioms?
- What is non-algebraic structure
- $K$-free lattice on two generators where $K=\{$two element lattice$\}$
- Characterizing the algebras on $\mathbb(Z)/2\mathbb(Z)$
- Graphs in a regular category
Related Questions in ADJOINT-FUNCTORS
- Show that a functor which preserves colimits has a right adjoint
- How do I apply the Yoneda lemma to this functor?
- Determining Left Adjoint of Forgetful Functor from $\tau_{*}$ to $\tau$
- What is the left adjoint to forgetful functor from Mod(R) to Ab
- Does the left adjoint to the forgetful functor have another left adjoint?
- Is coreflectiveness transitive?
- Group algebra functor preserves colimits
- Intuition for remembering adjunction chirality
- Does the inverse image sheaf functor has a left adjoint?
- Significance of adjoint relationship with Ext instead of Hom
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I'll sketch the proof strategy, but I think it's helpful to try filling in the details yourself if you're not familiar with the argument.
First, one should observe that the category $\mathbf{Law}$ of Lawvere theories is isomorphic to the category $\mathbf{Clone}$ of abstract clones. This follows fairly directly from the universal property of the cartesian product. By definition, the category $\mathbf{Clone}$ is clearly algebraic, in that it is presented by operations and equations. The sorts are given by the natural numbers $\mathbb N$, where each $n \in \mathbb N$ indexes the set $C_n$ of terms with $n$ free variables. Finally, every $S$-sorted algebraic theory is monadic over $\mathbf{Set}^S$: this follows from the equivalence between algebraic theories and finitary monads, but you can also prove it directly (e.g. by using Beck's monadicity theorem) if you want to avoid invoking that result.