amog.fun∘
Magnussen Institute for Applied Fun · est. 2026

amog.fun

A small category. The objects are games and quick experiments. The morphisms are afternoons, irreversibly spent.

$\Hom(\mathit{Bored},\, \mathit{Amused}) \neq \varnothing$

Cayley graph of S4, generated by (12)(23)(34)
random word: e · drag to rotate
§1

Objects of Fun

Everything here is small, fast, and a bit rough around the edges. Each object lives at amog.fun/<name>.

§2

The Founder

Three blocky avatars standing in front of a starfield under the caption: Obbyists' current skill ceiling, 4,219,429+++
Fig. 1. The founder and associates, shortly after showing the skill ceiling is bounded below by 4,219,429 and is probably unbounded.

Amog Magnussen

Founder & Chief Mathematician

Amog Magnussen founded amog.fun after spotting that every good afternoon factors through a small, dumb game. His research is in group theory, category theory, and obby.

He is best known for the following result. He is still working on the converse.

\begin{lemma}[Kholonosky]\label{lem:kholonosky} Let $\mathcal{C}$ be a locally presentable $(\infty,1)$-category and $F\colon \widehat{\mathcal{C}} \to \Cat$ a lax monoidal 2-functor out of its free cocompletion. Then $F$ admits a left Kan extension $\operatorname{Lan}_{y}F$ along the Yoneda embedding $y\colon \mathcal{C} \hookrightarrow \widehat{\mathcal{C}}$, unique up to contractible choice, provided the ambient Grothendieck topos has a subobject classifier $\Omega_{\text{lag}}$ for lag. \end{lemma}

skill ceiling
4,219,429+++, a word in the free monoid $\{+\}^{*}$
thesis
On the Uniform List Chromatic Number and Effective Palette Compactness, University of Ou
favourite group
The Monster group, for obvious reasons
favourite category
$\Grp$ on weekdays, $\Set$ on weekends
erdős number
Undefined. He only co-authors with people who can clear his obby.
“Every obby is a groupoid if you're brave enough.”A. Magnussen, 2026
§3

The Universal Property

\begin{theorem}[Magnussen, 2026]\label{thm:universal} For every state of boredom $B$ and every route to joy $g\colon B \to \mathit{Joy}$, there is a unique $h\colon \texttt{amog.fun} \to \mathit{Joy}$ such that $$h \circ f = g.$$

In other words, every fun thing factors uniquely through amog.fun.\end{theorem}

\begin{proof}Immediate from \ref{lem:kholonosky} with $\mathcal{C} = \Fun$. Alternatively, pick an object from §1 and play it.\end{proof}

B amog.fun Joy f g ∃! h ↻