Oriel — AI & technology worth noticing, every day.

How to prove equations using diagrams, part 3

Web page · https://epatters.org/post/e-graphs-3

First seen by Oriel on .

AI summary

This post extends initial-functor semantics for equational reasoning from bare categories to finite-product categories, presenting cartesian diagram rules and a diagrammatic proof of the lens PutTwice law.

  • Free cartesian diagrams formalize term graphs, encoding multiary operations, shared terms, and equations within algebraic theories.
  • Operation introduction, congruence reduction, equation elimination, and factorization are cartesian initial functors that preserve diagram limits.
  • Applying these rules derives PutTwice, showing put(put(s, v), v) = put(s, v) from the PutGet and GetPut lens laws.
  • The comprehensive factorization system restricts to cartesian categories and product-preserving functors, supported by results about elements constructions and Kan extensions.
  • Cyclic term graphs can represent infinitely many equivalent terms, while congruence reduction removes redundant diagram data.

#e-graphs #category theory #term graphs #lenses

Generated by gpt-5.6-sol. Check the original for details.

Metric trends

Last 30 days · Up to 120 recorded samples per source and metric, with reposts kept separate · First and latest retained

Points

Score reported by the source.

  • Lobsters: 2, latest observation ; +1 over observed period since

Comments

Comment count reported by the source.

  • Lobsters: 0, latest observation ; 0 over observed period since

Aliases

SourceExternal IDURL
Lobstersdr5zrzhttps://www.epatters.org/post/e-graphs-3/ Read discussion