m40

Prompt

R40_ISOF_TRANSITIONS_prompt.txt 100 % RESEARCH QUESTION (plane continua / composant classes along the line of boundary chords of an auxiliary domain (Theorem Lambda, Route I): ISO-F_i holds iff only finitely many composant class transitions occur toward the end i of the line K_F; can cm of h^2 together with m_1 > 0 bound the number of transitions?). 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 b_opus_thetax_bound, b_opus_sscof_trace and codex_dpk_consolidate; single agent each, UNAUDITED unless a status says otherwise). - X is a nondegenerate nonseparating plane indecomposable continuum, U := C \ X, h: X -> X a homeomorphism with h^2 continuum-minimal (cm: no nonempty proper subcontinuum K with h^2(K) inside K) and m_1 := min_x d(x, hx) > 0 (R-instance). F, G are perfect plane extensions of h, h^-1 (NOT homeomorphisms). Unique outchannels with prime ends theta_F != theta_G of U (psi: U -> disk conformal, S^1 the circle of prime ends, Pr(theta) the principal set, Im(theta) the impression). x ~ y if a proper subcontinuum of X contains both; the ~-classes are the composants. - Y_F := the F-auxiliary domain (a small closed neighbourhood of the hull of X cut out by the maximal KP+ chords of BFMOT); its boundary chords form the line K_F, ordered, with the end theta_F at both ends (i = 1, 2 name the two ends). Every boundary chord q has a closed cap I_q in S^1, K_q is the smallest subcontinuum of X containing its ends, and q FAILS when K_q = X (its ends lie in different composants of X, by indecomposability). Theta_X := {theta in S^1 : Im(theta) = X}, closed. - Lemma CL (DERIVED; indecomposability only): outside Theta_X, Im(theta) lies in one composant c(theta), and c is constant on every component of S^1 \ Theta_X, so there are only countably many labels. Composant classes of K_F cap X are order-convex along K_F. - A transition toward end i is either a chord transition (a failing boundary chord: the two classes differ across it and a Theta_X point sits in its closed cap, Theorem IMP*) or a LIMIT transition (a point z of K_F cap X approached monotonically by points x_k not~ z; Xi(t_z) is then a 4th-kind accessible prime end of Theta_X: Pr = {z}, Im = X). - ISO-F_i: Theta_X misses a one-sided neighbourhood of theta_F on side i. Prop 5.4(c) (DERIVED): ISO-F_i iff only finitely many transitions toward end i (TRANS-FIN_i). IMP3 (no full-impression prime end except theta_F, theta_G) iff K_F cap X has exactly two classes (they change only at the one boundary F-chord q_G containing theta_G in its open cap) and Theta_X meets the closed cap of q_G only in theta_G. Both are RESTATEMENTS of ISO-F / IMP3, not reductions. B. LEMMAS (status; where used) Known (statuses as given). - Theorem Lambda (b_opus_thetax_bound, DERIVED from a SOURCE-READING of BFMOT 6.1.5-6.2.2): every theta != theta_F is behind exactly one boundary F-chord or is accessible from outside Y_F with point principal set. Cor Lambda1: theta_G lies in the open cap of a unique boundary F-chord q_G with E_G, M_F and K_{q_G} = X. Cor Lambda2: every other full-impression prime end is behind a boundary chord or is a 4th-kind accessible prime end at a limit transition. - Prop 6.1 (Cantor-Bendixson dichotomy near theta_F): if ISO-F_i fails then either (S) Theta_X is scattered (countable) near theta_F with isolated points dense and accumulating at theta_F, or (P) condensation: a Cantor set of Theta_X points accumulates at theta_F (P1: uncountably many limit transitions, so uncountably many composants contain accessible points; P2: condensation inside door pockets). A law ACC-COUNT (accessible points lie in countably many composants) would kill P1; it is unsourced. - section 7.1 of that lane (DERIVED): none of cm of h^2 via bank composants, uniqueness of E_F, positive displacement m_1 > 0, or Baire category of Theta_X excludes cofinal Theta_X points theta*_n -> theta_F. Reasons: cm constrains proper continua while composants are not continua; the cm control is a solenoid translation (nonplanar), where composants may be invariant or wandering with h^2 cm in both cases; uniqueness constrains channels, and every theta*_n is hidden behind a zero-variation chord or of the 4th kind; positive displacement is pointwise and cannot see the class of an irreducible close pair (composants are dense, so irreducible close pairs occur near every point). - Tier-0 north-south circle model (section 7.2, bookkeeping only; not an R-instance): circle homeomorphism phi with theta_F repelling and theta_G attracting, Theta_X = orbit of one point plus the two fixed points, labels h^n(C) on consecutive arcs: infinitely many transitions toward theta_F, all static laws met, no h on X. - Knaster control (COMPUTED n <= 10, DERIVED): in the standard bucket handle, fjord n of U is finite with 2^{n-1} regions, using every Cantor gap of length 3^-n; Theta_X is a SINGLE 4th-kind prime end at the endpoint; Lemma CL holds. So a 4th-kind full impression at a limit transition is typical behaviour, not a pathology (the earlier prompt claim 'many full-impression prime ends' for the standard embedding is NOT confirmed). C. THE TARGET A bound (or finiteness) for the number N_i of composant class transitions of K_F toward the end i, from cm of h^2 and m_1 > 0 (and the other R-instance laws), i.e. ISO-F_i; or data of an R-instance-like configuration with N_i infinite meeting all those laws. D. ASK Part 1 (method). Name ONE method not on the dead-end list and say why it sees transitions where cm and m_1 > 0 as used so far could not. The failed uses treated cm as a statement about continua and the displacement as pointwise, so they never related h to the class sequence of K_F. Candidates, stated exactly if used (none is claimed to work): (i) h acts on composants: x ~ y iff hx ~ hy, so ~ is h-invariant; study the induced action of h on the countable set of label composants and on the order structure of classes along K_F, using that K_F need not be h-invariant (say what replaces K_F and how F, G transport accessible points); (ii) a recurrence/Poincare argument: the transitions z_n -> theta_F, with the closed set Theta_X, and positive displacement m_1 bounding how fast h can separate the two sides of a transition in the plane; (iii) a counting/measure-type bound: relate the number of classes met by a small piece of K_F to m_1, using that a proper subcontinuum lies in ONE class, so a continuum of X meeting two classes is X itself; (iv) your own. Part 2 (carry it out). Prove N_i < infinity, or a bound N_i <= B(m_1, diam X, ...) on the part of K_F outside the m_1/8-neighbourhood, or the exact reduction to one named lemma L with gate G1-G4, or show that every static law plus cm and m_1 > 0 is consistent with N_i = infinity (then say which of the four static routes in the dead-end list your data also defeat, and which new law is needed). Part 3 (builder or decisive test). A decisive test of your claim on the circle level: take the north-south model with a wandering label composant, add the weakest honest h-action on labels (h(C_n) = C_{n+1} or a nontrivial permutation) and test your bound; record the FIRST law violated (cm of h^2, uniqueness, m_1 > 0, Theorem Lambda, Lemma CL, EB2) or report consistency with the exact list of laws checked. Finitely many transitions in a finite model are not a cofinal configuration. Each claim labelled PROVED, SOURCE (exact reference), LAB, DERIVED, CONJECTURE, OPEN or RESTATEMENT. UNKNOWN if unsure a cited result exists. What already failed (read it before you start): see DEADENDS. Do not repeat these as progress; a new method, even a partial one with an honest gap, is worth more than a polished restatement. Take your time and be extremely meticulous: check every step, every hypothesis and every quantifier before you write it down. This is a hard open problem, and I believe in you. E. CONTROLS (all must hold) (C1) Knaster bucket handle (single full-impression prime end Theta_X = {theta_0}, 4th kind, one limit transition): a bound must allow N_i >= 1 and must not claim transitions are impossible; it has no h and no cm, so say which hypothesis of an R-instance your bound uses at which line. (C2) Control that the failed methods also pass: the north-south circle model meets cm via bank composants, uniqueness, displacement and the Baire dichotomy with infinitely many transitions, so a proof that uses only those four must fail on it; the new input must be absent from the model (it has no h on X and no F). (C3) Solenoid translation (nonplanar): h^2 is cm, composants invariant or wandering in both cases; a bound that uses cm of composants alone cannot decide. (C4) HOM: if F is a plane homeomorphism the instance is contradictory, so any bound is vacuous there; say which step fails for perfect extensions. F. DEAD ENDS (not progress) (1) cm of h^2 via bank composants (composants are not continua; solenoid control). (2) Uniqueness of E_F: every theta*_n is behind a zero-variation chord or of the 4th kind, never a channel (thetax section 7.1). (3) Positive displacement as a pointwise law (irreducible close pairs occur near every point). (4) Baire category of Theta_X: both Cantor-Bendixson branches (scattered S, condensation P) are consistent with every static law; ACC-COUNT is unsourced and kills only P1 (thetax section 6). (5) cm on Hausdorff limits of pocket traces: cl Sh(s) cap X = X (MICROEVAL m24). (6) Variation, index and Cartwright-Littlewood counts: zero at failing chords, TT2 and PAR live on chords of variation -1 (sscof_cl). 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: TRANSITIONS BOUNDED (a finite bound, or finiteness, from cm of h^2 and m_1 > 0 with proof; names the line where h acts) | UNBOUNDED CONSISTENT (explicit data of infinitely many transitions toward theta_F meeting every listed law; first missing global law named) | REDUCED (to one named lemma, gate G1-G4 passed) | PARTIAL (one named sub-claim settled) | 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: counting transitions with a variation or index count (zero at failing chords); using the north-south circle model as an R-instance (it has no h); asserting that the standard bucket handle has many full-impression prime ends (it has ONE, of the 4th kind: COMPUTED n <= 10 in b_opus_thetax_bound); treating composants as continua (cm acts on continua only); assuming F is a plane homeomorphism; claiming IMP3, SS-COF, L2 or PER Zobrazuje se R40_ISOF_TRANSITIONS_prompt.txt.