Statements from FPRD Lab papers

Theorems

Search theorem, lemma, proposition, and corollary statements from FPRD Lab publications. Each entry links to the statement in its complete paper.

61 theorems · 18 lemmas · 19 propositions · 9 corollaries

9 of 107 statements

propositionProposition 3.1

Corrected carrier rectangles

For an ordinary missing or base terminal and m≥1m\ge1 , carrier placements are the ideals of [m−1]×[n−m][m-1]\times[n-m] . For a recursive terminal, m=0m=0 is a singleton; for m≥1m\ge1 , placements are the ideals of [m−1]×[n−m−1][m-1]\times[n-m-1] .

Carrier cube

Filling every Boolean family of independent temporal slides gives the rooted CAT(0) order-ideal cube of Proposition 3.1 . For a rectangle with rr rows and cc columns it has rcrc hyperplanes, dimension min⁡(r,c)\min(r,c) , edge distance d(t,s)=∑i=1r∣ti−si∣,d(t,s)=\sum_{i=1}^{r}|t_i-s_i|, and coordinatewise-median carrier tuples.

Garbage-trivial collapse

If a legal DD or AA edge is trivial modulo garbage, it equals one descriptor garbage edge. If a legal TT edge is trivial modulo garbage, it equals a two-descriptor garbage path; the two orders agree by the garbage square.

Descriptor-support monotonicity

For every effective oriented horizontal move RR , DescSupp⁡(RH)⊆DescSupp⁡(H).\operatorname{DescSupp}(RH)\subseteq\operatorname{DescSupp}(H). Every coinitial horizontal/garbage-descriptor branching is therefore a strict naturality square modulo garbage.

propositionProposition 5.2

Support captures

The only mixed branches without a strict horizontal residual are A/GL(0),T/GL(0),T/GL(−1).A/GL(0),\qquad T/GL(0),\qquad T/GL(-1). They require no new generator: the garbage-first path returns along the inverse garbage edge and then takes the original reduction, so G;G−1;R=RG;G^{-1};R=R by vertical cancellation.

Local cell classification

Every coinitial effective horizontal pair is aspherical, Peiffer/cubical, D/A triangular, A/T hexagonal, or D/T derived. Every horizontal/garbage pair is a strict naturality square or one of the three cancellation captures. Every garbage-trivial horizontal edge has a collapse cell from Lemma 4.2 .

Uniform guarded path presentation

Fix a finite alphabet and history length in degree one and distance one. In each final behavioral fibre, all parallel paths generated by endpoint detours, literal absorptions, causal-garbage changes, and temporal slides are presented by the following length-independent guarded cell families: garbage same-coordinate…