# Merging incomparable linearizations

**URL:** <https://delvingbitcoin.org/t/merging-incomparable-linearizations/209>\
**Category:** Implementation\
**Tags:** wg-cluster-mempool, mempool\
**Created:** [November 19, 2023, 4:12am UTC](https://delvingbitcoin.org/t/merging-incomparable-linearizations/209 "2023-11-19T04:12:15Z")\
**Posts on this page:** 1\
**Showing post:** 15

<div class="post-metadata">

**Author:** ![sipa](https://delvingbitcoin.org/user_avatar/delvingbitcoin.org/sipa/32/1100_2.png) [@sipa](https://delvingbitcoin.org/u/sipa)\
**Post date:** [November 26, 2023, 3:33am UTC](https://delvingbitcoin.org/t/merging-incomparable-linearizations/209/15 "2023-11-26T03:33:29Z")

</div>

I don’t think I follow the last paragraph.

This \epsilon\_j + \delta\_j + \zeta\_j diagram, is that considering this expression at different values of j? I’m confused how it can be evaluated at S(\gamma\_j), or really how it forms a diagram at all.

Also generally, to prove a diagram is everywhere ≥ than another, you need to show both that all points of the first lie ≥ the second, but **also** that all points of the second lie ≤ the first.

---

_[View the full topic](https://delvingbitcoin.org/t/merging-incomparable-linearizations/209)._