A Characterization of Ordered Sets and Lattices via Betweenness Relations

For a set X with at least 3 elements, we establish a canonical one to one correspondence between all betweenness relations satisfying certain axioms and all pairs of inverse orderings “<” and “>” defined on X for which the corresponding Hasse diagram is connected and all maximal chains contain at least 3 elements. For an ordering “<”, the corresponding betweenness relation B is given by % MathType!MTEF!2!1!+-% feaaeaart1ev0aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXanrfitLxBI9gBaerbd9wDYLwzYbItLDharqqt% ubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq% -Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0x% fr-xfr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaamyuam% aaBaaaleaacaaIXaGaaGimaaqabaGccqGH9aqpciGGSbGaaiOBaiaa% ysW7caWGRbWaaSbaaSqaaiaadsfacaaIXaaabeaakiaac+cacaWGRb% WaaSbaaSqaaiaadsfacaaIYaaabeaakiabg2da9iabgkHiTmaabmaa% baGaamyramaaBaaaleaacaWGHbaabeaakiaac+cacaWGsbaacaGLOa% GaayzkaaGaey41aq7aaiWaaeaadaqadaqaaiaadsfadaWgaaWcbaGa% aGOmaaqabaGccqGHsislcaWGubWaaSbaaSqaaiaaigdaaeqaaaGcca% GLOaGaayzkaaGaai4laiaacIcacaWGubWaaSbaaSqaaiaaikdaaeqa% aOGaaGjbVlaadsfadaWgaaWcbaGaamysaaqabaGccaGGPaaacaGL7b% GaayzFaaaaaa!5C4A!$$B=\{(x,y,z)\in X^3\mid x<y<z {\rm \ or\ }z<y<x\}.$$ Moreover, by adding one more axiom, we obtain also a one to one correspondence between all pairs of dual lattices and all betweenness relations.