D-CPT Law: Duality in CPT Posets

• D-CPT Law is a framework in order theory that asserts the equivalence between posets with both dual and universal CPT-representations.
• It leverages techniques like modular decomposition and CI-subposet structures to ensure that path containment relations are preserved under duality.
• The law resolves an open problem by unifying duality, comparability invariance, and model-theoretic perspectives in poset representation theory.

The D-CPT Law refers to a family of results and formal statements involving discrete symmetries, combinatorial order theory, high-energy theory, and machine learning, where the designation "D-CPT law" has been used independently across several subdomains. Within order theory—specifically, the theory of posets (partially ordered sets) and their representations—the D-CPT Law asserts the equivalence of two natural classes of posets related to containment of paths in a tree. In this setting, the D-CPT Law establishes a structural theorem regarding the invariance of path containment posets under dualization and transitive orientation. The precise mathematical content, proof methodology, and theoretical significance are central to contemporary developments in the structural theory of containment posets (Alcón et al., 2022).

1. Formal Definition of CPT Representations and Related Poset Classes

A finite poset $P=(X,{\le}_P)$ is said to admit a "CPT-representation" if there exists a tree $T$ and for each element $x\in X$ a subset $W_x\subseteq V(T)$ such that $W_x$ induces a path in $T$, and for all $x,y\in X$,

$$x \le_P y \quad \Longleftrightarrow \quad W_x \subseteq W_y.$$

This can equivalently be described by embedding the ground set $X$ as a set of paths in $T$ and defining $x\leq_P y$ if and only if the path corresponding to $x$ is contained within that of $y$ (Alcón et al., 2022).

Building on this, two subclasses are defined:

• Dually-CPT posets: $P$ is dually-CPT if both $P$ and its dual $P^d$ admit CPT-representations.
• Strongly-CPT posets: $P$ is strongly-CPT if every poset with the same comparability graph as $P$ is a CPT poset.

By construction,

$$\{\text{strongly-CPT}\} \subseteq \{\text{dually-CPT}\}.$$

2. Main Theorem: Equivalence of Dually-CPT and Strongly-CPT Classes

The D-CPT Law formalizes the following equivalence: $$\boxed{ P \text{ is strongly-CPT} \iff P \text{ is dually-CPT}. }$$ This result establishes that the class of posets for which both the poset and its dual admit a CPT-representation coincides exactly with the class of posets for which every transitive orientation compatible with the comparability graph admits a CPT-representation (Alcón et al., 2022).

The significance is twofold: (i) it closes the question posed by Alcón, Gudiño, and Gutierrez as to whether the inclusion $$\{\text{strongly-CPT}\}\subsetneq\{\text{dually-CPT}\}$$ is strict, and (ii) it demonstrates that dual CPT representability characterizes comparability-invariance for this containment class.

3. Key Structural Lemmas Underlying the Proof

Several technical ingredients form the backbone of the proof:

• Modular decomposition: Every comparability graph $G_P$ of a poset $P$ admits a unique decomposition into strong modules, with the associated quotient graph being parallel (edgeless), series (complete), or prime (both $G$ and $\bar{G}$ connected).
• CI-subposet structure: If $P$ is CPT and $z\in P$, then the subposet on the closed down-set $D[z]$ is a containment-of-intervals (CI) poset. For dually-CPT posets, the analogous property holds for closed up-sets.
• Normalization: One can always normalize a CPT-model of a dually-CPT poset so that no path representing a nontrivial strong module is trivial (a single vertex), and modules meeting on a trivial path become blocked cliques (total orders where path endpoints cannot be further separated).
• Replacement/substitution lemma: In a normalized model, paths representing modules that are not trivial can have any CI model spliced in, preserving containment relations. The blocked clique case is handled via a simpler construction.

These lemmas ensure that the modular structure and the interval containment properties can be transferred between different orientations and between a poset and its dual.

4. Proof Strategy and Methodological Framework

The proof proceeds by:

1. Starting with a dually-CPT poset $P$ and constructing CPT-models for both $P$ and $P^d$.
2. Deriving a normalized CPT-model for the associated prime quotient $Q=P/\mathcal{M}$ where $v_i\in Q$ indexes strong modules $M_i$ of $P$.
3. Invoking Gallai's theorem on modular decomposition and transitive orientations: any other orientation $P'$ of the comparability graph is obtainable by replacing each module $M_i$ by either itself or its dual.
4. Using the substitution lemma to construct, via splicing, the requisite CI-models for these modules into the normalized tree model.
5. Demonstrating that containment relations among modules are preserved, ensuring that every orientation yields a valid CPT model.

Therefore, for any $P$ dually-CPT, all orientations of its comparability graph are CPT, establishing the equivalence (Alcón et al., 2022).

5. Structural and Theoretical Consequences

The D-CPT Law establishes that the class of CPT posets stable under transitive orientation (i.e., those whose comparability graphs universally yield CPT-realizable orders) is characterized precisely by the property of dual representability. In more formal terms, CPT posets form a comparability-invariant class if and only if the poset and its dual both admit CPT-representations.

The proof interrelates containment models (paths in trees), interval order theory (interval containment posets), and modular decomposition in comparability graphs, providing a comprehensive structural understanding of when path-containment orderings enjoy this strong form of invariance.

6. Resolution of Previously Open Problems and Research Impact

The D-CPT Law provides a complete resolution to the open question of whether the strongly-CPT poset class is a strict subclass of the dually-CPT class. The established equivalence answers negatively: the classes coincide. This aligns the modular/graph-theoretic perspective with the model-theoretic (containment) characterization, thereby unifying two major approaches in the study of order-theoretic representations.

In the broader context of poset representation theory, this equivalence refines the classification of posets admitting containment models and reveals the formal correlation between duality and comparability invariance, directly influencing subsequent research on generalized containment structures, representability hierarchies, and interval order extensions (Alcón et al., 2022).