batch9

Prompt

RESEARCH QUESTION (P2EX siege: PPA-EXCLUSION prover for an inaccessible swapped principal pair). Self-contained. Label every claim PROVED (you prove it), SOURCE (exact reference; unchecked?), LAB (from this prompt, status as given), CONJECTURE, OPEN, or RESTATEMENT (a gap reworded). If a definition is ambiguous, state your reading in one line and continue. Say where your argument stops. A. DEFINITIONS PRE-DISPATCH CERTIFICATE (batch 9, owner microeval channel). (C1) R1 / E_p^-, arrow CAN <=> P2EX (siege 1). Prove PPA-EXCLUSION: in the setting below no 2-cycle of inaccessible prime ends exists, i.e. no nondegenerate principal continua P, P' sharing an anchor with F(P) = P', F(P') = P. YES makes P2EX a conditional theorem on the LAB inputs (still unaudited) and closes the last non-accessible case of the R1 map branch; NO is an explicit configuration or one precise missing lemma and keeps CAN open. Neither outcome alone is CLOSED. (C2) Controls: ARC-4^- is the positive control for the bare combinatorics of a swapped pair (genuine 2-cycle; it must exit at decomposability or singleton principal sets); the rotating p-od is the nearest negative control for hull arguments (carrier is one point). Both are defined in section E; global controls and exits are there too. (C3) New: the lab's orbit-hull report (LAB-3) stops at the branch r(C) = p, where the translates C_i of C = P u P' are pairwise disjoint and cm is silent. This prompt asks for a planar argument inside that branch from b^p(C) = C, the arc-swap of h and the sector geometry of two principal continua sharing one anchor, not another hull-graph argument. Lab provenance ids (not available to you; all needed content is below): tw135P2EX (LAB-1), its audit P2EXAUD, tw135P2EXB (LAB-6), tw136PPAEX (LAB-3). (C4) Duplicate check. Prior lab work on P2EX: the main chain and its first audit, the orbit-hull index report, the audited accessible-case lemmas, a proof-file consolidation; siblings R153-R158 take the other angles. This prompt is only the PPA prover on the r(C) = p branch and the r(C) = 1 consistency question. Definitions: a continuum is a nonempty compact connected metric space; subcontinua are closed and connected; nondegenerate means more than one point. Planar means embeddable in R^2, hence in the sphere S^2 = R^2 + {inf}; nonseparating means S^2 minus X is connected. Tree-like: for every eps>0 an onto map to a finite tree with all fibres of diameter < eps (tree-like continua are hereditarily unicoherent, HU: two subcontinua meet in the empty set or a continuum). Indecomposable: not a union of two proper subcontinua. Chainable: arc-like. For a homeomorphism g: cm(g) means no proper nonempty g-invariant subcontinuum; cm_strong(g) is the same with singletons counted as subcontinua, so g has no fixed point. Per(g), Fix(g): periodic, fixed points. FPP (fixed point property) means every continuous self-map has a fixed point; PPF means periodic-point-free; PFPP is the open plane fixed point problem (does every nonseparating plane continuum have FPP?). Cartwright-Littlewood (SOURCE): an orientation-preserving homeomorphism of the plane leaving a nonseparating plane continuum invariant has a fixed point in it (Bell, Brown extensions). Lab vocabulary: R1, E_p^- = lab route labels (setting below); siege 1 = the lab's current attack on P2EX. Statuses: PARTIAL/OBSTRUCTION = author's verdict; UNAUDITED = no audit yet; CONFIRMED-WITH-REPAIRS = audit passed, repairs not yet written in; one GPT agent = one GPT run; never assign VERIFIED/CLOSED. Take your time, be extremely meticulous, I believe in you. SETTING (route R1, branch E_p^-; LAB; package UNAUDITED). X is a nondegenerate planar nonseparating tree-like indecomposable continuum in R^2, U = S^2 minus X (a simply connected domain containing inf), and X = boundary(U) (clause BD; (INFERRED) automatic, as planar tree-like X has empty interior). p is an odd prime. b: X -> X is a homeomorphism with cm_strong(b) and anchor cycle A = {a_0,...,a_{p-1}}, b(a_i) = a_{i+1}; the a_i are called anchors. Sources disagree on the spectrum hypothesis: Per(b) = A or only Fix(b^p) = A; OPEN, stated per use below. F: S^2 -> S^2 is an ORIENTATION-REVERSING homeomorphism with F(X) = X, F(inf) = inf and F|X = b^p; so F^2 preserves orientation, F^2|X = b^{2p}, and b^p, b^{2p} are NOT cm (anchors are fixed singletons): cm(F) is never a substitute for cm(b). Complement PPF: F has no periodic point in R^2 minus X ((INFERRED): the fixed point inf is excluded; PPF on X is vacuous since F^2 fixes a point of X by Cartwright-Littlewood/Bell). Prime ends. Let phi map {|z|>1} + {inf} conformally onto U with phi(inf) = inf (normalisation only; F need not commute with phi). Prime ends of U correspond to points of the unit circle. For a prime end e, the impression Imp(e) and the principal set Prin(e) are subcontinua of X with Prin(e) inside Imp(e); e is accessible iff Prin(e) is one point (its landing point) (SOURCE: Mather; Pommerenke; numbering UNSURE); e is full-principal if Prin(e) = X. F induces a homeomorphism h = h_F of the circle with Imp(h e) = F(Imp e), Prin(h e) = F(Prin e). Since F reverses orientation, h has exactly two fixed ends xi_0, xi_1, swaps the two arcs between them, and h^2 preserves orientation and has fixed points, so every h-periodic end has least period 1 or 2. A 2-cycle is a pair {e, e'} with h(e) = e' != e. P2EX: no 2-cycle exists, i.e. Fix(h^2) = {xi_0, xi_1}. CAN (LAB) is the lab's canonical prime-end law: Fix(h) = {xi_0, xi_1} and no other periodic prime ends (lab paraphrase; original wording not reproduced); a corrected lab audit states CAN is equivalent to P2EX (LAB). LBACC (LAB name of this branch's standing package) includes: the two fixed ends are full-principal, Prin(xi_0) = Prin(xi_1) = X; it gives no prime-end action of b itself, only of F = b^p (its one-step landing law is not used here). Oversteegen-Valkenburg Example 5.4 (SOURCE, not rechecked): a planar pseudo-arc embedding with every impression the whole pseudo-arc and a dense second-category set of full-principal ends, so many full-principal ends carry no static contradiction. B. LEMMAS (status; where used) LAB-1 (PARTIAL, one GPT agent; same-family audit CONFIRMED-WITH-REPAIRS): assuming Per(b) = A and X indecomposable, an accessible 2-cycle is impossible: both ends would land at one anchor (landing covariance gives F^2(x) = x, hence x in A, hence F(x) = x), but an accessible point of an indecomposable plane continuum carries one prime end (SOURCE cited there: Brechner 1978; Cinc-Oprocha 2022; the lab also gives its own two-Jordan-curve proof; neither rechecked here). Hence every 2-cycle {e,e'} consists of INACCESSIBLE ends with nondegenerate principal sets P = Prin(e), P' = Prin(e') sharing an anchor (the lab gets the anchor from Cartwright-Littlewood applied to the F^2-invariant continuum P, which is tree-like and hence nonseparating, plus Per(b) = A and F(a) = b^p(a) = a), F(P) = P', F(P') = P, and C = P u P' satisfies b^p(C) = C. The lab calls this configuration PPA; PPA-EXCLUSION is the statement that no PPA configuration exists. The audit calls PPA-EXCLUSION logically equivalent to P2EX inside the standing axioms; the lab's question tree lists it as a smaller residual: OPEN which is right (immaterial except where stated). LAB-3 (OBSTRUCTION, one GPT agent, UNAUDITED): for PPA put C_i = b^i(C), Q = union of the C_i (i in Z/p), D(C) = {d : C meets b^d(C)}, r(C) = gcd(p, D(C)) (gcd(p,{0}) = p), so r(C) is 1 or p. Claimed PROVED there: the components of Q are the unions of the C_i over cosets of the subgroup generated by D(C); Q is a continuum iff r(C) = 1; otherwise Q has exactly r(C) = p components permuted cyclically by b. If r(C) = 1 then Q = X by cm_strong(b) and the LAB-3 source states that a full-principal swapped pair is forced (derivation not rechecked here); if r(C) = p the hull is disconnected, the C_i are pairwise disjoint (each C_i contains exactly the anchor a_i) and cm(b) is silent. The fixed-prime-end lemma proposed for this case (a lab lemma: fixed prime ends under cm have singleton impressions at fixed points) is inapplicable because the map with the prime-end action is F^2, and F^2|X = b^{2p} is not cm. The extra premise AE_p (every b^p-invariant continuum through an anchor is a point or X) is NOT a sourced standing clause; under AE_p one gets P = P' = Imp = X. LAB-6 (one GPT agent, UNAUDITED): for a 2-cycle {eta_0, eta_1} put I_i = Imp(eta_i). Prime-end functoriality gives b^p(I_0) = I_1, b^p(I_1) = I_0, b^{2p}(I_0) = I_0, and K_2 = union over j < 2p of b^j(I_0) is compact and b-invariant. Under cm(b), a connected proper K_2 is impossible, so every 2-cycle satisfies (P2-OF): K_2 = X or K_2 is disconnected. DERIVED (elementary): h reverses the circle with exactly two fixed ends, so it swaps the two open arcs between xi_0 and xi_1; hence the two members of any 2-cycle lie on opposite arcs. Used for: any sector or cross-cut argument. C. THE TARGET Prove or refute PPA-EXCLUSION in the setting, separately under (R-A) Per(b) = A and (R-B) only Fix(b^p) = A, saying which reading each step uses. Core sub-claim: in the branch r(C) = p (C_i = b^i(C) pairwise disjoint, each containing exactly the anchor a_i) a swapped inaccessible pair with F(P) = P', F(P') = P and P cap P' containing an anchor cannot occur, or give the configuration. Also decide whether the branch r(C) = 1 (full-principal swapped pair, Prin = X for both ends) is contradictory, or consistent with Oversteegen-Valkenburg Example 5.4; the LAB-3 source asserts it is forced, derivation not rechecked here (OPEN). D. ASK Write one linear proof. Step 1: re-derive the r(C) dichotomy from the definitions (check D(C) is a subset of Z/p, the gcd claim, and where HU enters) or find an error. Step 2: in r(C) = p locate where P cap P' = {anchor} sits relative to the two fixed ends and the sector between the swapped ends; use F^2 = b^{2p} on X and Cartwright-Littlewood/Bell for F^2 (orientation-preserving) only if the invariant continuum is nonseparating; say which candidate invariant continuum you use. Step 3: state exactly where planarity, nonseparation, tree-likeness, indecomposability and cm_strong(b) each enter. If the proof fails, isolate one lemma, give its strictness test, and say what ARC-4^- does on it. Research, not audit. Use LAB items only as ASSUMED-name or re-prove them. Label results DERIVED/COMPUTED/CONJECTURE/FAILED/OPEN with dependencies, weakest step, insight. Check hypotheses, degenerate cases, quantifiers, orientation signs. A reduction needs implication and strictness proofs, else RESTATEMENT. Abstract is not planar; finite checks prove nothing infinite. No novelty/VERIFIED/CLOSED claims; no helper agents. Computation optional (exact arithmetic, independent verifier). E. CONTROLS (all must hold) Control objects (lab controls, SOURCE-lab, not rechecked here). ARC-4^-: X = [-1,1] x {0}, f the time-one map of the flow of v(x) = (x^3 - x)/(1 + x^4) (an increasing homeomorphism of [-1,1] with Fix(f) = {-1,0,1} and no other periodic points), F(x,y) = (f(x), -2y) (orientation-reversing; R^2 minus X is PPF). Its prime ends are x^+ and x^- (upper and lower sides) for -1 < x < 1 plus one end at each endpoint; h(x^+) = f(x)^- and h(x^-) = f(x)^+, so the endpoint ends are the two fixed ends (singleton principal sets, not full-principal) and {0^+, 0^-} is a genuine 2-cycle whose ends land at the one point (0,0), which has two accesses (the two slit sides). X is decomposable and chainable, and an odd root b of f on the arc is increasing, so it has no nontrivial anchor cycle. Rotating p-od: p arcs E_0, ..., E_{p-1} meeting only at a centre o, b rotating the arms; the b^p-invariant cover A_0 = E_0, A_1 = the other arms has common intersection of all b-translates {o}, so the carrier (that b-invariant intersection) is one point, forbidden only by cm_strong; translates of the terminal half of one arm are pairwise disjoint (the r(C) = p pattern). Pseudo-arc: the hereditarily indecomposable chainable plane continuum. Pseudo-circle: a hereditarily indecomposable circle-like plane continuum. SPIRAL(3): a lab calibration continuum, planar and separating (construction not reproduced here). Disk with a whisker: a closed disk with an arc attached outward; X has interior. Global (lab facts): the pseudo-arc has FPP (never a PPF control); SPIRAL(3) and the pseudo-circle separate the plane; disk with whisker fails BD. State each added control's first exit. Node controls: P cap P' = {x}, F(x) = x, F reversing, F(P) = P' occurs in decomposable chainable hosts (ARC-4^- slit sides), so the proof must use indecomposability, tree-likeness, nonseparation or cm_strong(b) at a named step, and must fail at that step on ARC-4^-. A proof that works verbatim for a disk with whisker (BD fails) or for a chainable host is suspect. Test any hull argument on the rotating p-od (r(C) = p with a singleton carrier). F. DEAD ENDS (not progress) Do not re-prove the accessible case, ROOTNERVE or ROOTCOVER, or restate the hull dichotomy without an exit. Do not assume AE_p, do not replace cm(b) by cm(F) or cm(b^p), and do not treat F-invariance of C as b-invariance. Do not claim P2EX from PPA-EXCLUSION without the strictness check that the lab audit calls logical equivalence (inside the standing axioms). G. FORMAT Line 1 exactly: VERDICT: PROVED | COUNTEREXAMPLE-CANDIDATE | PARTIAL | OPEN-OBSTRUCTION | RESTATEMENT. Then SUMMARY (<= 100 words), the argument (<= 2,000 words), STILL OPEN EXACTLY. Short of effort: line 1 + summary; an honest OPEN is valid. No finite computation as proof; no theorem beyond its hypotheses; UNKNOWN if unsure a cited result exists. RED FLAGS: using cm(F) or cm(b^p) in place of cm(b); treating Per(b)=A as sourced when the lab's builder report supplies only Fix(b^p)=A; assuming AE_p silently; assuming P u P' is b-invariant; confusing impression with principal set