TFPT scientific source excerpt Original repository path: experiments/theory-contracts/foundational-process-classification-20261016/PROOF.txt Original file SHA-256: c478329caf5bfa8bbf69bf066745e9bbb9908d4652d52a428e04b6992bc385fa Inclusive original lines: 45-83 Line numbers below refer to the original source. This bounded excerpt is source evidence; it is not a new proof/checker run. Conversation metadata and personal execution details are omitted where indicated. 000045 | 000046 | 2. Class A: event orders without a background geometry 000047 | 000048 | INPUT: an unlabeled finite strict partial order P=(E,<). A precedence relation, 000049 | transitivity and absence of cycles are assumed; causal order is not derived 000050 | from consistency in THIS class. There are no rates, amplitudes or metric. 000051 | 000052 | JOINT CONSEQUENCE: cumulative occurrence states are the order ideals J(P). 000053 | They form a distributive lattice under union and intersection. Its nonzero 000054 | join-irreducibles are exactly principal ideals down(e), recovering the events 000055 | and their order. Maximal one-event-at-a-time ideal chains are the linear 000056 | extensions. Thus one relational datum specifies events, cumulative states and 000057 | allowed histories together. These are occurrence states, not quantum states 000058 | or physically stored memories; the event order remains an input. 000059 | 000060 | COUNTERWORLDS: at each ideal I a fixed-P Markov growth law independently 000061 | chooses weights on the enabled events. Invariance under relabeling constrains 000062 | weights, but need not select them. For a