Wiki has interesting chapter https://en.wikipedia.org/wiki/Adjoint_functors#Solutions_to_optimization_problems that adjoint functors can be used for optimization, I guess more in the sense of finding optimal objects, structures. Is this original idea whose first exposition is in the wiki article or maybe there are available some references and elaborations of this idea? It would be good to know them? References will suffice, I can study them further.

Also, I guess, such optimization can use for solving the “optimal, paradox free deontic logic” as sketched in my previous question https://nforum.ncatlab.org/discussion/9838/category-of-institutions

]]>I’m struggling to further develop the page on Schur functors, which Todd and I were building. But so far I’ve only done a tiny bit of polishing. I deleted the discussion Todd and I were having near the top of the page, replacing it by a short warning that the definition of Schur functors given here needs to be checked to see if it matches the standard one. I created a page on linear functor and a page on tensor power, so people could learn what those are. And, I wound up spending a lot of time polishing the page on exterior algebra. I would like to do the same thing for tensor algebra and symmetric algebra, but I got worn out.

In that page, I switched Alt to $\Lambda$ as the default notation for exterior algebra. I hope that’s okay. I think it would be nice to be consistent, and I think $\Lambda$ is most widely used. Some people prefer $\bigwedge$.

]]>