m23

Prompt

RESEARCH QUESTION (plane topology / planar 2-page fold rearrangements; RIG-THICK, the surviving case W2 (partial-reversing, interleaving junctions): which noncrossing fold rearrangements of the label order can occur at an interleaving turn, and which of them can the cut law CUT see?). 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 Setting (compressed from the lab files a_fable_dtower, b_opus_signlaw_zhat and the lane rigthick_reverse_opus_1102; DERIVED-U or DERIVED by single agents, UNAUDITED; (INFERRED) = my bridging). - Host: Zhat := the profinite integers, D: Zhat \ {0} -> E_amb continuous and even with D(2N) = sigma D(N); E := the cluster set of D at 0 (a Cantor set). Fibre points p_m(e) (m in Z, e in E). X := the closure of the regular points; the host Y_D := ([0,1] x K)/folds with fence F and fold Phi is planar iff 2PAGE holds: there is an embedding P: X -> S^1 in which F and Phi are noncrossing matchings. We fix such a P. H(t, x) = (2t, 2x) has no periodic point, h := H^-1 (so m_k > 0 for all k, the hypothesis PPF). - For |n| >= M_0 (far) Hull(P_n^0) is the smallest closed arc of S^1 containing P(P_n x {0}) (short); H^0(n) := P^-1(Hull(P_n^0)) is the hull. A jump of the fibre order <_n^0 of P_n^0 is an open arc between consecutive fibre points; a point of H^0(n) \ P_n^0 is an intruder. A turn q is the fold step P_{-q}^0 -> P_q^0 (the chords {p_{-q}(f), p_q(f)}, f in E); it is interleaving if the hulls H^0(-q), H^0(q) meet, and clean if it is non-interleaving AND Phi H^0(-q) = H^0(q) (the strong reading; the weaker literal reading of a_fable_dtower admits interleaving turns). - Orders: <_{-q} and <_q are the orders of E induced by the points p_{-q}(e), p_q(e) along the circle. (B2): at a non-interleaving turn <_q is the reverse of <_{-q}. - The band and its rails: a strip is a pair g = (x', x) of adjacent labels (a gap of the label order); at the band's iota_0-turn q, in(e) = p_{-q}(e), out(e) = p_q(e), I = [in a, in b] and H' = [out a, out b] (rails a, b), "with all points of K in them". Lemma PC: the band crosses height 0 inside one product chart iff I cap H' is empty and iota_0(I) = H', i.e. no iota_0-chord has both ends in I or both in H'; a chart failure is therefore an iota_0-chord inside a hull. Lemma CF: a chart failure happens only at an unclean turn. (Statements as quoted below.) - CUT and FOLD (b_opus_signlaw_zhat; quoted below): the label order on the restriction M of the labels is a cut circle order (a cyclic order cut open at one gap C); at two octave-clean depths tau_1 < tau_2 whose sinks are strips, the cut is the same gap, C(tau_1) = C(tau_2). B. LEMMAS (status; where used) Known (verbatim from the lab files; UNAUDITED). - (C4) The fibre chords {(p_{-q}(f),0),(p_q(f),0)}, f in E, lie in the arc Hull(P_q^0) cup Hull(P_{-q}^0) and are pairwise nested or disjoint; the induced bijection (E, <_{-q}^0) -> (E, <_q^0) is a continuous noncrossing labelled rearrangement, not necessarily monotone. **Theorem CUT (DERIVED).** If tau_1, tau_2 are octave-clean with k <= K_* at both and both have a strip sink at power k, it is the same strip. If L_tau|M is a cut circle order with cut C(tau) and the sinks are strips, then **C(tau_1) = C(tau_2)**: the sink at power k is the gap C + k, and the outchannel of h^k is unique. **Lemma FOLD (DERIVED from F9 R6, SOURCE-lab; (K3) of a_fable_dtower).** A whole-fibre fold at q puts hull(P_-q) in one jump of L_q next to label D(2q), when 2q is deep against the hull, and the new cut is that jump. So if the sinks are strips, a cut moved by a fold must return before the next octave-clean depth: between the two folds the unclean turns form a chain with consecutive ratios below 2. Consecutive differences in such a chain are multiples of the hull modulus, so that modulus is at most q (thick hull at scale q). A stable cut has no whole-fibre fold at far turns. - iota_0 maps strand m to strand -m. So along a chord, p -> iota_0 p keeps its line type, while p itself flips type. - Hence passes continue on their line along chords from I to H'. They appear or vanish in pairs (one same-direction, one reflected, at equal depth) at chords inside H' or inside I. - **A pass changes line exactly at points of I cap H'.** - Put Q := N_same - N_refl. Then Q = +1 where eps = -1, and Q = -1 where eps = +1. **An RP turn must change Q by 2 (net one line change of a gap chord), and a reversing turn must leave Q unchanged.** The per-chord change is t(p)([iota_0 p in H'] - [p in H'] - [p in I] + [iota_0 p in I]), where t(p) = +-1 is p's line before the turn. This is 0 for continuations, for fingers, and for X-crossings. Residual as the lane states it (verbatim, section 4): After B+ and CF a reversing chart failure is: **W2 partial-reversing** (a rail chord inside a hull; interleaving, so a_fable_dtower (C3) palindrome and a possible (C4) rearrangement of L, where CUT can act; OPEN); **W3 straight with an intruder finger** (an internal pair {z, iota_0 z} inside I, dying at q, or inside H', born at q; non-interleaving, unclean); **W4 straight with an end inside I or H'** (degenerate pair y = -q). BLIND-CUT covers W3, W4; non-strip fingers change neither Q nor Ret. The new constraints come from NF. The lane's suggested next test: CUT/FOLD on the (C4) rearrangement with the strip sink fixed. C. THE TARGET A finite model of one interleaving turn (INFERRED; the abstraction of (C4) and of the lane's cf_check run on all noncrossing partial involutions of n <= 9 points). A word of length 2n over {a, b} read along an arc (a = in-points p_{-q}(e), b = out-points p_q(e)) with a noncrossing perfect matching M of the 2n positions, every chord joining an a to a b (the fold chord of one label). If the a-point of a label has rank i among the a-points and its b-point rank pi(i) among the b-points, pi = pi_M is a permutation of {1..n}: the rearrangement (<_{-q} to <_q). The turn is interleaving iff the two hulls (first to last a; first to last b) overlap. All a before all b (or the reverse) forces nested chords and pi = reversal (this is (B2)). Let N_n denote the set of pi_M, n labels. Hand facts (INFERRED, to be proved or corrected in Part 1; no machine run here). (i) Peeling: take the chords not nested in another (they are side by side). pi is the direct sum of the permutations of these top-level components; a component with outer chord (a left, b right) and inner permutation pi' on m-1 labels is (m, pi'); with outer chord (b left, a right) it is (pi'+1, 1). So a nonempty member is a direct sum of blocks, each starting with its maximum or ending with its minimum, with the remainder again a member. (ii) N_1 = {1}, N_2 = S_2, N_3 = S_3; N_4 = S_4 minus {2413, 3142, 3412}. (iii) Dihedral members (pi(i) = s +- i mod n): every reflection is a direct sum of two reversals, hence a member; a rotation by r is a member only for r = 0, 1, n-1 (rotation by 2 on n = 4 is 3412, not a member). (iv) The word abab with chords (1,4), (2,3) has hulls overlapping and pi = reversal; with chords (1,2), (3,4) it has pi = identity. So interleaving does not mean non-monotone. D. ASK Part 1 (single-turn classification). Prove or correct (i)-(iv). Then classify the members of N_n by the induced action on the circular order of the n labels: (A) pi = identity, (B) pi = reversal, (C) pi dihedral but neither (a reflection with the cut moved, or a rotation by +-1), (D) pi not dihedral. For (A) and (B) say whether the cut and the strip (x', x) (a pair of consecutive labels) are preserved, and prove that for (B) the argument of Prop BLIND-CUT (the lane's observation that a global reversal changes neither eps, nor the strip sink, nor the cut) applies verbatim at an INTERLEAVING turn, using only that the rearrangement is the reversal. For (C) say where the cut goes. For (D) say what is destroyed. Part 2 (what CUT and FOLD see). Using Theorem CUT and Lemma FOLD as quoted: decide which of (A)-(D) a single interleaving turn can be, if the label order on the relevant set M is a cut circle order and the sinks are strips, treating the chain of unclean turns inside a window (ratios < 2) explicitly: can a chain of (C)- or (D)-turns restore the cut before the next octave-clean depth, and is N_n closed under composition? (Give two members of N_n whose composite is not a member, or prove closure.) Name the exact residual after this, as a statement about chains. Part 3 (the W2 contact). For an interleaving turn with pi = reversal (type B) and an iota_0-chord inside a hull (a chart failure, Lemma PC), apply Lemma LL and Prop Q: write the change of Q = N_same - N_refl at the turn, using the per-chord change t(p)([iota_0 p in H'] - [p in H'] - [p in I] + [iota_0 p in I]), and decide whether a reversing turn (Q unchanged) with a rail chord inside a hull is consistent, by a finite example (n <= 4 chords) and/or a proof. If it is consistent, say which law is the only remaining obstruction (NB? NF? Theorem B+ itself? NR?). If it is not, give the proof. Part 4 (infinite label set). Say what survives for E a Cantor set: a noncrossing labelled rearrangement of a compact totally disconnected order that preserves a cyclic order up to reversal and its cut. Is it the identity or the reversal? Argue by finite clopen partitions (state what a limit of members of N_n can be) or give a counterexample; say what part of the host (stable circle order versus splice hosts, where L is not a circle order) the argument covers. Each claim labelled PROVED, SOURCE (exact line), LAB, DERIVED, COMPUTED, CONJECTURE, OPEN or RESTATEMENT. UNKNOWN if unsure a cited result exists. E. CONTROLS (all must hold) (C1) Strong clean control: the interleaving word abab with chords (1,2), (3,4) (pi = identity) and with chords (1,4), (2,3) (pi = reversal) both have overlapping hulls; a classification that calls either non-interleaving is wrong. (C2) Rotation-by-two control: pi = 3412 (n = 4) is not in N_4; any "rotation moves the cut" claim must treat rotation by r >= 2 separately. (C3) Non-monotone control: the word abaabb with chords (1,2), (3,6), (4,5) has overlapping hulls and pi = (1,3,2) on three labels; a step that treats every interleaving rearrangement as monotone is wrong. (C4) Single-turn control: CUT is a statement about two octave-clean depths, not about one turn; a proof must say which composite it uses. (C5) Quantifier control: the finite model has n labels; the host has a Cantor set of labels and a window of turns; say where finiteness enters. F. DEAD ENDS (not progress) (1) "A reversing contact contradicts CUT": false (BLIND-CUT), and by Part 1 it stays false at interleaving reversals. (2) Re-proving Lemma PC, CF, NB, Z0, LL, Prop Q, TL+, B+ (assumed as quoted). (3) Rotation-label hosts (STABLE-ROT), W3, the NPC branch, Theorem J: other tasks. (4) Counting configurations as an argument (cf_check is finite evidence only). (5) Renaming W2 as "no chart failure": the claim must be a classification with proof. RESTATEMENT GATE (mandatory; answered BEFORE the headline, in its own section). If your verdict reduces the node N to a residual lemma L (with or without other proved pieces), you must give ALL of: (G1) the exact statement of L and of N side by side, with the same standing hypotheses; (G2) a proof that L implies N (the reduction); (G3) a reason L is STRICTLY weaker than N: either an explicit configuration (or consistent abstract data meeting every standing law) where L holds and the conclusion of N is not yet available, or the named hypothesis of L that the negation of N does NOT supply; (G4) the line of your argument where L's own hypothesis (the defect, the witness, the scale) is actually used; if it is never used, L is a restatement. If G3 or G4 fails, the headline word is RESTATEMENT, not REDUCED, and the answer reports the proved building blocks only. A headline REDUCED without G1-G4 counts as a failed answer. G. FORMAT Line 1 exactly: VERDICT: W2 CLASSIFIED (single-turn classification proved: which interleaving rearrangements are cut-blind, which move the cut, which destroy the circle order; consequence for W2 stated) | W2 BLIND (the partial-reversing junction with a chart failure is consistent with CUT, Q and LL: explicit finite data, extension to the infinite label set discussed) | W2 EXCLUDED (proof that a chart failure at an interleaving reversing turn contradicts a named law) | PARTIAL (one named sub-claim settled, which) | OPEN. 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: treating a finite permutation count as a statement about the infinite Cantor label set; calling a turn clean or non-interleaving when its hulls overlap; mixing the weak and the strong reading of clean (the strong reading is: non-interleaving AND Phi H^0(-q) = H^0(q)); applying CUT to a single turn; forgetting that a moved cut may return inside the window (FOLD); claiming RIG-THICK, L2 or PER