Path lifting can remember order even when homotopy forgets escape

groverbennett1 pts0 comments

Escape-Broken Continuation, Brandt Partial Actions, and Order-Sensitive Survival Operations | Zenodo

Skip to main

You are using an outdated browser. Please upgrade your browser to improve your experience.

Published July 26, 2026

| Version v1

Preprint

Open

Escape-Broken Continuation, Brandt Partial Actions, and Order-Sensitive Survival Operations

Authors/Creators

Grover-Bennett, Katie

Description

Let π: F → Y be a noninjective local diffeomorphism. Continuation of a fiber point along a path is unique when it exists, but it may fail through nonproper escape. We develop a path-level theory of this partial continuation and determine exactly which mathematical objects retain or forget its history.

The groupoid of surviving-homotopy classes is canonically isomorphic to the fundamental groupoid of the source, Cont_hist(π) ≅ Π₁(F). It therefore retains only source homotopy and is blind to representative-dependent escape. Full escape information lives before homotopy quotienting, in a maximal partial-lift system on Moore paths that records lifting domains, endpoint maps, escape times, and maximal lifts. Its finite operational quotient is the continuation inverse monoid on a chosen fiber, while germs of loop-family transports retain only realized endpoint pairs.

For the Pinchuk presentation we compute the continuation inverse monoid exactly as the six-element Brandt monoid B₂¹, including an absorbing zero. Representing its elements by partial isometries produces completely positive, trace-nonincreasing continuation operations. Two itineraries containing identical continuation blocks in different orders can yield respectively a nonzero rank-one operation and zero, establishing order-sensitive survival.

The remaining structural question is whether a useful canonical quotient can retain the death certificates of escaping branches without retaining the entire raw path space.

Preprint, version 0.8. Independent expert verification remains outstanding. The lower-bound Pinchuk realizations carry the explicitly stated Campbell Figure 3 verification gate; the upper bound does not.

Files

continuation-groupoid-v0_8.pdf

Files<br>(266.5 kB)

Name<br>Size

Download all

continuation-groupoid-v0_8.pdf

md5:aad4dc9bf9c20d8e2e25df4db639dc31

266.5 kB

Preview

Download

15

Views

Downloads

Show more details

All versions<br>This version

Views

Total views

15

15

Downloads

Total downloads

Data volume

Total data volume

266.5 kB<br>266.5 kB

More info on how stats are collected....

Versions

External resources

Indexed in

OpenAIRE

Communities

Details

DOI

DOI Badge

DOI

10.5281/zenodo.21606390

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.21606390.svg)](https://doi.org/10.5281/zenodo.21606390)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.21606390.svg<br>:target: https://doi.org/10.5281/zenodo.21606390

HTML

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.21606390.svg

Target URL

https://doi.org/10.5281/zenodo.21606390

Resource type<br>Preprint

Publisher<br>Zenodo

Rights

Copyright

Copyright © 2026 Katie Grover-Bennett. All rights reserved.

Citation

Export

Technical metadata

Created

July 26, 2026

Modified

July 26, 2026

Jump up

This site uses cookies. Find out more on how we use cookies

Accept all cookies<br>Accept only essential cookies

zenodo continuation escape https partial path

Related Articles