How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Crossing sharpness and subcritical decay for square-lattice FK
Statement
Assume Countable Choice. For every real , put . The square-lattice free and wired cylinder-limit FK probability laws exist. For every , both have positive percolation probability. For every , there are such that every arbitrary-boundary cylinder-limit FK state satisfies In particular, both percolation probabilities vanish below and . These conclusions do not identify the free and wired measures at the critical parameter.
Statement references
The Axiom of Countable Choice ()
Free, wired, and subsequential infinite-volume FK states on the square lattice
Existence of the free and wired infinite-volume FK limits
Numerical FK cylinder limits and pressure comparison
Wired FK annuli and the numerical self-dual threshold
Subcritical FK exponential connectivity under Countable Choice
Facts & Assumptions
Given: Real , parameters , and the square-lattice model and percolation thresholds of Free, wired, and subsequential infinite-volume FK states on the square lattice.
Countable Choice, in the sense of The Axiom of Countable Choice (), is assumed for the countably additive probability-law and countable coupling constructions below.
Under [A1], free and wired finite-box FK laws have countably additive Borel cylinder-limit probability laws (Existence of the free and wired infinite-volume FK limits).
Write for the cylinder event of an origin path to within , and for the numerical cylinder weights. With , the numerical pressure comparison proves whenever (Numerical FK cylinder limits and pressure comparison).
The numerical threshold construction proves for every (Wired FK annuli and the numerical self-dual threshold).
Under [A1], the subcritical exponential-decay lemma gives the displayed two-point bound uniformly for every arbitrary-boundary cylinder-limit state whenever (Subcritical FK exponential connectivity under Countable Choice).
Proof
By [A1] and [F1] the free and wired probability laws exist. In either law the events decrease with . Their intersection is precisely the event that the origin cluster is unbounded: connection to every box boundary is equivalent to an unbounded cluster, and every finite path reaching a farther boundary contains an initial path to the nearer boundary. Countable additivity gives continuity from above, hence . This uses actual existing probability laws, rather than inferring their existence from consistent numerical cylinder weights.
Fix and set . Then . By [F2] and [F3], , while [F3] directly gives . Step 1.1 proves positive percolation for both laws at . No equality of free and wired laws is used.
For apply [F4]. In particular, each free or wired law satisfies the displayed bound. An origin path to reaches one of its vertices, each of Euclidean norm at least . A finite union bound gives . Step 1.1 then gives zero percolation. Both defining infima are , since every parameter above it belongs to each positive-percolation set and none below it does. The bound for all other cylinder-limit states is already exactly [F4].
Remarks
The finite numerical annulus construction and pressure comparison are choice-free. Countable Choice is stated explicitly where the proof requires actual infinite-volume Borel laws and the subcritical countable coupling process. Free/wired threshold coincidence is proved here by comparison across two distinct parameters, without an additional planar threshold-coincidence assumption.
Depends on
The Axiom of Countable Choice ()
Free, wired, and subsequential infinite-volume FK states on the square lattice
Existence of the free and wired infinite-volume FK limits
Numerical FK cylinder limits and pressure comparison
Wired FK annuli and the numerical self-dual threshold
Subcritical FK exponential connectivity under Countable Choice