>**Puzzle 212.** We can get a feasibility relation by taking either the companion or the conjoint of a monotone map, thanks to the ideas in the puzzles of [Lecture 65](https://forum.azimuthproject.org/discussion/2299/lecture-65-chapter-4-collaborative-design/p1). Which of the feasibility relations in this lecture's puzzles are companions or conjoints?

This companion and conjoint business is confusing but from what I've been able to put together, its basically the two ways of creating a feasibility relation from a monotone function? It seems to be related to whether the feasibility relation is based on "at most" or "at least" or both or none? This is still very distant to me and I think I need more examples to get some intuition. Has anyone worked the answers to this puzzle?