Aspect-uniform matching roots; P398 is periodic IC TL (do not merge) - #718
Aspect-uniform matching roots; P398 is periodic IC TL (do not merge)#718LightChainr wants to merge 1 commit into
Conversation
…iodic IC TL
On axis rectangles m>=w>=2, p_{w,m} -> p_c^site uniformly in the long side as
w->infty. No m/w bound and no w/log(wm)->infty. Compare exponential rates of
P0 and P2 via Harris and disjoint slabs, even when both are tiny. H=P2/(P0+P2)
is not the birth-mixture F; #613 stays for the full law.
P398 is the periodic identified-connectivity O(1) TL chain on 2w endpoints:
Phi D_i = e_{2i} Phi, Phi J_i = e_{2i+1} Phi. #715's join-only distinction
was a representation error. eta <-> -eta via half-step K, K^2 = site rotation.
Stationary law at eta=0 is the published FPL/RS pushforward, imported not proved.
Additive on main. Independent of #708-#716. Do not merge. Full-repo CI not run.
|
Do not merge. Independent: Catalan bijection |
|
Completed follow-up proof for the next handoff (not a change to this PR's existing rectangular scope; no merge/STATUS request): the balance-root conclusion extends to arbitrary rank-two integer-period lattices Lambda with shortest nonzero Euclidean period ell->infinity, with no area/aspect/shear restriction. Let N=[Z²:Lambda]. Choose a shortest u, complete to a reduced basis (u,v) with det(u,v)=N>0 and |u·v|<=ell²/2. The transverse height is h=N/ell>=sqrt(3)ell/2. The exact transverse vertex coordinate is det(u,x) mod N; u need only be primitive in Lambda, not in ambient Z². For ell>=64 set r=ell/64 and use the local site arm a_r (first-exit support r+sqrt(2), which injects). Harris gives P0 >= (1-a_r)^N. Slice transverse height into k=floor(8N/ell²) vertex-disjoint bands of physical width ell/8, with boundaries shifted off vertices. Rank 2 forces an occupied crossing of EVERY band. Unit-square area packing bounds the possible entry vertices by 4 ceil(ell), uniformly in tilt. Thus P2 <= [4 ceil(ell) a_r]^k. Also k>=4N/ell². Site sharpness a_r<=C exp(-c ell/64) now yields P2/P0<=exp[-kappa(p) N/ell] below p_c; matching complementation gives the reciprocal bound above. Consequently sup_{ell(Lambda)>=L}|p_Lambda-p_c|->0. This is still a ROOT/conditional-rank-odds theorem, not full birth-law concentration, and supplies no near-critical convergence exponent or numerical p_c. A further corollary handles any positive p-independent source W with osc(log W)=o(N/ell): its rank-2/rank-0 odds differ by at most exp(±osc(log W)), so ALL its balance zeros converge to p_c. Uniqueness is only preserved under extra structure (e.g. product log-odds fields); I have an exact 4x4 positive NONPRODUCT mark with at least three finite zeros, so I do not assert general uniqueness. Executed finite checks: 2,080 HNF reductions; 215,040 oblique graph/configuration checks; 107,520 complementary pairs; 80 larger fixed structural controls including tilted Gaussian ideals. The theorem is proved by the geometry/rate comparison, not by extrapolating these checks. Full proof and standalone scripts are in the current owner handoff. Existing #718/#732 remain correct at their stated scope; do not re-dispatch their original rectangular calculation. |
|
The completed arbitrary-period proof, its executable controls and the marked-source extension are now filed as PR #735 (base main, do not merge, standalone: no dependency on unmerged #708/#710/#716 assets). What #735 adds on top of the outline posted here:
What #735 does not provide, so it is not mistaken for the full birth-law theorem: no quantitative near-critical rate, no L^-4 law, no new numerical p_c, no arm constants, and no concentration of the full birth-time distribution. On extremely long thin sequences the mixing law can keep splitting toward 0 and 1 while the balance root still tends to p_c. |
Draft. Do not merge. Additive on
main@eb89e942. Independent of the unmerged #708–#716 stack. Corrects the process identification in #715. Does not rerun #709 rank certificates.Matching roots on rectangles
For axis periods
(w,0),(0,m)withm≥w≥2,No bound on
m/w, now/log(wm)→∞. Finite boundsP0 ≥ (1-a_R)^{wm}(Harris, decreasing events; overlapping boxes) andP2 ≤ (w a_R)^{⌊m/(R+1)⌋}(disjoint slabs). Rates, not sizes. Site sharpness via Duminil-Copin–Tassion site adaptation; not a bond theorem copied to site.On
w=j,m=⌈e^{j²}⌉this is compatible with #716:L(T)⇒½δ_0+½δ_1andp_{w,m}→p_c. #613 remains the condition for the full threshold law.H=P2/(P0+P2)is notF. Snapshot Fisheris independent Bernoulli at one
p, not a Newman–Ziff bound. No tilted-torus claim, no numericalp_c.P398 = periodic IC TL on 2w ends
Endpoint doubling
i ↦ (L_i=2i, R_i=2i+1)is a bijection NC-partitions(w) ↔ NC-perfect-matchings(2w). ThenΦ D_i = e_{2i} Φ,Φ J_i = e_{2i+1} Φ. Detach is even-position TL, join is odd-position TL. Named object: zero-defect periodic identified-connectivity O(1) TL chain (Pearce–Rittenberg–de Gier–Nienhuis; reconnection as in Cantini–Sportiello). Transpose vs some column-state conventions.Still not microscopic square-site percolation. IC disk quotient cannot replace #708 lifted rank states.
Half-step
K:K²= rotate sites by one,K^{2w}=I, not an involution.G_η[π,π']=G_{-η}[Kπ,Kπ'].b(Kπ)=w+1-b(π). Stationary atη=0is the published RS/FPL pushforwardπ_0(π)=FPL_w(Φ(π))/A_wwithA_w=∏(3j+1)!/(w+j)!(2,7,42,429). Imported theorem, not reproved. No claim of full FPL dynamics, no same formula for allη.#709 pulse ranks stay; only the “unnamed process” sentence in #715 is wrong.
Independent Grok check
|NC_w| = C_w = |NC matchings of 2w|;fattenbijection tolink_patterns(2w)forw=2..6.Φ∘join_i = e_{2i+1}∘Φ,Φ∘detach_i = e_{2i}∘Φ(tests + seami=w-1).K²= site rotation on all statesw=2..5;G_{1/3}conjugate toG_{-1/3}atw=3.b+b∘K = w+1;A_w = 2,7,42,429.main.Full-repo CI not run. Next retrieval: (i) published matching-root consistency without aspect bound, vs full-law theorems; (ii) IC TL dynamics for the exact
S,F,Hof #709, not another “is this a named process” search.