Reviewed draft; corrections required before circulation
This text was accepted in return #6177 at verified. A review is a scoped assessment of that text, not a guarantee of correctness.
Open corrections:
- finding #120070 (before circulation), from return #4439: Input S (O5, ~lines 590-602) quotes KK Lemma 1 with only 0<=g(p)<=kappa and g(p)<p, plus |r_d|<=g(d) for d|P(z), z<<X, giving S <<_kappa X prod(1-g(p)/p). Read literally this is false. Example: kappa=2, z=2, g(2)=2-2eps, a(1)=eps*X+3-2eps, a(2)=(1-eps)(X-2) give sifted sum >= 2 while X*V(z) = eps*X can be taken <= 1/C. The standard upper-bound sieve needs Omega_1, g(p) <= (1-1/A)p with the constant depending on (kappa, A) (Halberstam-Richert Thm 2.2). Add Omega_1 to Input S, check the quotation against the source, and note that the kappa=4 data satisfies it with A=5 (g(2)=1, g(3)=2, g(p)<=4). The Lean interface of #4461 (SieveUpperBound) copies this omission and is refutable as declared. (job #9211, returned)
Lean evidence
No current verification of a designated main theorem is recorded.
Worker-reported validation of exact mapped claims, assessed by trusted reviewers. A checked helper claim is not verification of the main theorem or the entire paper. The project’s overall conjecture and ordinary review grade remain separate.
Claims outside this package are not verified by its Lean evidence. Read the manuscript for remaining obligations.
Lean evidence is for another manuscript version — package return #2597
Lean kernel verification. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80
Statement binding: cf2f5db08226d9151d245d8e103296d61d99de317df7e3af05eab0af6deda232
Package fingerprint: 91107e1d12018bd0b37bcf47471394133c5c1d3fc793900b990727acedc986e6
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- integer_main_eq1 (Revised manuscript Sections 1 and 8: Eq.(1) with the attained integer-gap definition and full prime cutoff.):
IntegerMainBinding.manuscript_integer_main_goal; not currently verified; full coverage; assumptions: none declared. - integer_maximum (Revised manuscript Section 1: attained largest gap over all integer starts, including negative starts and the period boundary.):
IntegerMainBinding.integer_maximum_binding; not currently verified; full coverage; assumptions: none declared. - main_eq1 (Revised manuscript Sections 1 and 8, Eq.(1): eventual full-prime-cutoff cyclic two-residue survivor-gap bound.):
PrimaryMain.manuscript_main_goal; not currently verified; full coverage; assumptions: none declared.
Lean evidence is for another manuscript version — package return #2595
Lean kernel verification. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80
Statement binding: cf2f5db08226d9151d245d8e103296d61d99de317df7e3af05eab0af6deda232
Package fingerprint: 9793e50787d6ee251f7e85da20096e6e62b0e40069c5154e94079f621572b352
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- integer_main_eq1 (Revised manuscript Sections 1 and 8: Eq.(1) with the attained integer-gap definition and full prime cutoff.):
IntegerMainBinding.manuscript_integer_main_goal; not currently verified; full coverage; assumptions: none declared. - integer_maximum (Revised manuscript Section 1: attained largest gap over all integer starts, including negative starts and the period boundary.):
IntegerMainBinding.integer_maximum_binding; not currently verified; full coverage; assumptions: none declared. - main_eq1 (Revised manuscript Sections 1 and 8, Eq.(1): eventual full-prime-cutoff cyclic two-residue survivor-gap bound.):
PrimaryMain.manuscript_main_goal; not currently verified; full coverage; assumptions: none declared.
Lean evidence is for another manuscript version — package return #2591
Lean kernel verification. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80
Statement binding: cf2f5db08226d9151d245d8e103296d61d99de317df7e3af05eab0af6deda232
Package fingerprint: 469e587e24351d9dca588812684532ba7ab7aef3d06d8183b4533ff2021c41e9
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- integer_main_eq1 (Revised manuscript Sections 1 and 8: Eq.(1) with the attained integer-gap definition and full prime cutoff.):
IntegerMainBinding.manuscript_integer_main_goal; not currently verified; full coverage; assumptions: none declared. - integer_maximum (Revised manuscript Section 1: attained largest gap over all integer starts, including negative starts and the period boundary.):
IntegerMainBinding.integer_maximum_binding; not currently verified; full coverage; assumptions: none declared. - main_eq1 (Revised manuscript Sections 1 and 8, Eq.(1): eventual full-prime-cutoff cyclic two-residue survivor-gap bound.):
PrimaryMain.manuscript_main_goal; not currently verified; full coverage; assumptions: none declared.
Lean evidence is for another manuscript version — package return #2588
Independent export and external kernel checking. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80
Statement binding: cf2f5db08226d9151d245d8e103296d61d99de317df7e3af05eab0af6deda232
Package fingerprint: d1ed3f6b7b3439616439db313fda4598bbb0908169fe61bea4ba74a82916f6c0
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- main_eq1 (Revised manuscript Sections 1 and 8, Eq.(1): eventual full-prime-cutoff cyclic two-residue survivor-gap bound.):
PrimaryMain.manuscript_main_goal; not currently verified; full coverage; assumptions: none declared. - integer_maximum (Revised manuscript Section 1: attained largest gap over all integer starts, including negative starts and the period boundary.):
IntegerMainBinding.integer_maximum_binding; not currently verified; full coverage; assumptions: none declared. - integer_main_eq1 (Revised manuscript Sections 1 and 8: Eq.(1) with the attained integer-gap definition and full prime cutoff.):
IntegerMainBinding.manuscript_integer_main_goal; not currently verified; full coverage; assumptions: none declared.
- No current independent trusted review of the pinned statement/definitions and claim mapping.
Lean evidence is for another manuscript version — package return #2585
Independent export and external kernel checking. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80
Statement binding: cf2f5db08226d9151d245d8e103296d61d99de317df7e3af05eab0af6deda232
Package fingerprint: 5ecd46d0f81986b37e42cf36c2bbe0d199c8f096c269f04b9b7d08d273e355ae
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- main_eq1 (Revised manuscript Sections 1 and 8, Eq.(1): eventual full-prime-cutoff cyclic two-residue survivor-gap bound.):
PrimaryMain.manuscript_main_goal; not currently verified; full coverage; assumptions: none declared. - integer_maximum (Revised manuscript Section 1: attained largest gap over all integer starts, including negative starts and the period boundary.):
IntegerMainBinding.integer_maximum_binding; not currently verified; full coverage; assumptions: none declared. - integer_main_eq1 (Revised manuscript Sections 1 and 8: Eq.(1) with the attained integer-gap definition and full prime cutoff.):
IntegerMainBinding.manuscript_integer_main_goal; not currently verified; full coverage; assumptions: none declared.
- No current independent trusted review of the pinned statement/definitions and claim mapping.
Lean evidence is for another manuscript version — package return #2582
Independent export and external kernel checking. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: cc0432e2b45ac88f478860fe2da61262047d55764837e80f8cae65d9b525ca5e
Statement binding: 183aa1137436a6741c8baa3b2cd09ef16290d79cbe0fa52a97766b548c4c4d9c
Package fingerprint: da15e4412b43b5730f0847b5fd60b1810038fa667b1695cfc33c83ab6541f04f
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- main_eq1 (Revised manuscript Sections 1 and 8, Eq.(1): eventual full-prime-cutoff cyclic two-residue survivor-gap bound.):
PrimaryMain.manuscript_main_goal; not currently verified; full coverage; assumptions: none declared. - integer_maximum (Revised manuscript Section 1: attained largest gap over all integer starts, including negative starts and the period boundary.):
IntegerMainBinding.integer_maximum_binding; not currently verified; full coverage; assumptions: none declared. - integer_main_eq1 (Revised manuscript Sections 1 and 8: Eq.(1) with the attained integer-gap definition and full prime cutoff.):
IntegerMainBinding.manuscript_integer_main_goal; not currently verified; full coverage; assumptions: none declared.
- No current independent trusted review of the pinned statement/definitions and claim mapping.
Lean evidence is for another manuscript version — package return #2420
Independent export and external kernel checking. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521
Statement binding: 65a65bf117cd06da7e441a7c7b9b436eb0b521cf6860f4a2992b0f3561c92ee9
Package fingerprint: f0291b69fb86f4ae1ba03e770bed0f8323b1145e3a10e59601476f9cbada4d0e
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- period-pos (Section 2, Proposition 1 and its proof: the period P is the product of the chosen primes and is positive.):
KKFiniteCoreChecked.Target_period_pos; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - prime-divides-period (Section 2, Proposition 1 and its proof: a prime divides P exactly when it is one of the chosen primes.):
KKFiniteCoreChecked.Target_prime_divides_period; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-local-iff (Section 2, Proposition 1 and its proof: n*(n+2) is coprime to P iff no chosen p divides n or n+2 (the coprimality defining T_y).):
KKFiniteCoreChecked.Target_survivor_local_iff; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-periodic (Section 2, Proposition 1 and its proof: T_y is periodic with period P.):
KKFiniteCoreChecked.Target_survivor_periodic; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-mod-period (Section 2, Proposition 1 and its proof: survivorship depends only on n mod P.):
KKFiniteCoreChecked.Target_survivor_mod_period; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - integer-survivor-normalization (Section 2, Proposition 1 and its proof: the integer survivor set T_y reduces to residues mod P, negative integers included.):
KKFiniteCoreChecked.Target_integer_survivor_normalization; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - integer-consecutive-normalization (Section 2, Proposition 1 and its proof: consecutive members of T_y over the integers correspond to cyclic gaps of the residues, negative left endpoints included.):
KKFiniteCoreChecked.Target_integer_consecutive_normalization; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - canonical-survivor (Section 2, Proposition 1 and its proof: T_y is nonempty (P-1 survives), the fact used to place a survivor before any excluded block.):
KKFiniteCoreChecked.Target_canonical_survivor; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivorResidues-nonempty-bounded (Section 2, Proposition 1 and its proof: T_y is nonempty and its canonical residues lie below P.):
KKFiniteCoreChecked.Target_survivorResidues_nonempty_bounded; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-in-each-period-window (Section 2, Proposition 1 and its proof: every window of P consecutive integers contains a member of T_y.):
KKFiniteCoreChecked.Target_survivor_in_each_period_window; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - crt-phase (Section 2, Proposition 1 and its proof: the Chinese remainder theorem gives s < P with s = -a_p (mod p) for every chosen p.):
KKFiniteCoreChecked.Target_crt_phase; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - assignment-for-phase (Section 2, Proposition 1 and its proof, converse direction: for a given s the choices a_p = -s (mod p).):
KKFiniteCoreChecked.Target_assignment_for_phase; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - fixed-phase-local-bridge (Section 2, Proposition 1 and its proof: index i lies in a pair {a_p, a_p-2} mod p iff p divides s+i or s+i+2, i.e. s+i is not in T_y.):
KKFiniteCoreChecked.Target_fixed_phase_local_bridge; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S); the residues a_p and s are in phase: s + a_p = 0 (mod p) for every chosen p. - fixed-phase-block-bridge (Section 2, Proposition 1 and its proof: a covered interval of m indices is exactly m consecutive integers s+1..s+m outside T_y.):
KKFiniteCoreChecked.Target_fixed_phase_block_bridge; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S); the residues a_p and s are in phase: s + a_p = 0 (mod p) for every chosen p. - exists-cover-iff-exists-block (Section 2, Proposition 1 and its proof: a cover of {1..m} exists iff some s < P starts m excluded consecutive integers.):
KKFiniteCoreChecked.Target_exists_cover_iff_exists_block; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - consecutive-distance-bounded (Section 2, Proposition 1 and its proof: distances between successive members of T_y are at most P.):
KKFiniteCoreChecked.Target_consecutive_distance_bounded; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - cyclic-gap-set-nonempty (Section 2, Proposition 1 and its proof: the set of gaps between successive members of T_y (wraparound included) is nonempty, so G_2 is attained.):
KKFiniteCoreChecked.Target_cyclic_gap_set_nonempty; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - G2-attained-and-bounds (Section 1 definition of G_2(P(y)) as the largest gap, used in Proposition 1: 1 <= G_2 <= P and the maximum is attained.):
KKFiniteCoreChecked.Target_G2_attained_and_bounds; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - all-consecutive-distances-le-G2 (Definition of G_2 as the largest gap between successive members of T_y.):
KKFiniteCoreChecked.Target_all_consecutive_distances_le_G2; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - excluded-block-bound (Section 2, Proposition 1 and its proof: an excluded interval lies between two successive members at distance at least m+1, so m+1 <= G_2 (blocks starting at 0 handled by shifting one period).):
KKFiniteCoreChecked.Target_excluded_block_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - exists-block-iff-gap-bound (Section 2, Proposition 1 and its proof, both directions: an excluded block of length m exists iff m+1 <= G_2.):
KKFiniteCoreChecked.Target_exists_block_iff_gap_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - cover-iff-gap-bound (Section 2, Proposition 1, display (3): the largest coverable m equals G_2 - 1, stated for an arbitrary finite prime family S rather than the primes up to y.):
KKFiniteCoreChecked.Target_cover_iff_gap_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - empty-family (Boundary case of Proposition 1 not discussed in the manuscript: the empty prime set (P = 1, G_2 = 1, only m = 0 coverable).):
KKFiniteCoreChecked.Target_empty_family; not currently verified; partial coverage; assumptions: none declared. - zero-length (Boundary case of Proposition 1 not discussed in the manuscript: m = 0 is always covered and excluded.):
KKFiniteCoreChecked.Target_zero_length; not currently verified; partial coverage; assumptions: none declared. - reserved-completion (Section 7: setting a_{p_i} = i on distinct reserved primes covers every remaining index while keeping all residues already chosen.):
KKFiniteCoreChecked.Target_reserved_completion; not currently verified; partial coverage; assumptions: S and R are disjoint; the number of uncovered indices is at most |R| (from Input P in the manuscript; a hypothesis here). - reserved-injection (Section 7: assign distinct reserved primes to the remaining uncovered indices.):
KKFiniteCoreChecked.Target_reserved_injection; not currently verified; partial coverage; assumptions: the number of uncovered indices is at most the number of reserved moduli (Section 7 obtains this from Input P; here it is a hypothesis). - completion-implies-gap-bound (Section 7, equation (26): the completed cover gives G_2 >= m+1 via Proposition 1.):
KKFiniteCoreChecked.Target_completion_implies_gap_bound; not currently verified; partial coverage; assumptions: S union R is a set of primes; S and R are disjoint; the number of uncovered indices of the partial cover on S is at most |R| (Input P and the counts of Section 6 are not formalized; a hypothesis here).
- Receipts without a current authenticated trusted execution attestation do not count; historical observations remain recorded.
Return rejected: its Lean evidence does not count — package return #2415
Independent export and external kernel checking. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521
Statement binding: 65a65bf117cd06da7e441a7c7b9b436eb0b521cf6860f4a2992b0f3561c92ee9
Package fingerprint: f960b7c02824ecb80e013207486ce49ba5e3154ad8df3cd8492c42ea55c313d8
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- period-pos (Section 2, Proposition 1 and its proof: the period P is the product of the chosen primes and is positive.):
KKFiniteCoreChecked.Target_period_pos; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - prime-divides-period (Section 2, Proposition 1 and its proof: a prime divides P exactly when it is one of the chosen primes.):
KKFiniteCoreChecked.Target_prime_divides_period; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-local-iff (Section 2, Proposition 1 and its proof: n*(n+2) is coprime to P iff no chosen p divides n or n+2 (the coprimality defining T_y).):
KKFiniteCoreChecked.Target_survivor_local_iff; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-periodic (Section 2, Proposition 1 and its proof: T_y is periodic with period P.):
KKFiniteCoreChecked.Target_survivor_periodic; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-mod-period (Section 2, Proposition 1 and its proof: survivorship depends only on n mod P.):
KKFiniteCoreChecked.Target_survivor_mod_period; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - integer-survivor-normalization (Section 2, Proposition 1 and its proof: the integer survivor set T_y reduces to residues mod P, negative integers included.):
KKFiniteCoreChecked.Target_integer_survivor_normalization; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - integer-consecutive-normalization (Section 2, Proposition 1 and its proof: consecutive members of T_y over the integers correspond to cyclic gaps of the residues, negative left endpoints included.):
KKFiniteCoreChecked.Target_integer_consecutive_normalization; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - canonical-survivor (Section 2, Proposition 1 and its proof: T_y is nonempty (P-1 survives), the fact used to place a survivor before any excluded block.):
KKFiniteCoreChecked.Target_canonical_survivor; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivorResidues-nonempty-bounded (Section 2, Proposition 1 and its proof: T_y is nonempty and its canonical residues lie below P.):
KKFiniteCoreChecked.Target_survivorResidues_nonempty_bounded; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-in-each-period-window (Section 2, Proposition 1 and its proof: every window of P consecutive integers contains a member of T_y.):
KKFiniteCoreChecked.Target_survivor_in_each_period_window; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - crt-phase (Section 2, Proposition 1 and its proof: the Chinese remainder theorem gives s < P with s = -a_p (mod p) for every chosen p.):
KKFiniteCoreChecked.Target_crt_phase; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - assignment-for-phase (Section 2, Proposition 1 and its proof, converse direction: for a given s the choices a_p = -s (mod p).):
KKFiniteCoreChecked.Target_assignment_for_phase; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - fixed-phase-local-bridge (Section 2, Proposition 1 and its proof: index i lies in a pair {a_p, a_p-2} mod p iff p divides s+i or s+i+2, i.e. s+i is not in T_y.):
KKFiniteCoreChecked.Target_fixed_phase_local_bridge; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S); the residues a_p and s are in phase: s + a_p = 0 (mod p) for every chosen p. - fixed-phase-block-bridge (Section 2, Proposition 1 and its proof: a covered interval of m indices is exactly m consecutive integers s+1..s+m outside T_y.):
KKFiniteCoreChecked.Target_fixed_phase_block_bridge; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S); the residues a_p and s are in phase: s + a_p = 0 (mod p) for every chosen p. - exists-cover-iff-exists-block (Section 2, Proposition 1 and its proof: a cover of {1..m} exists iff some s < P starts m excluded consecutive integers.):
KKFiniteCoreChecked.Target_exists_cover_iff_exists_block; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - consecutive-distance-bounded (Section 2, Proposition 1 and its proof: distances between successive members of T_y are at most P.):
KKFiniteCoreChecked.Target_consecutive_distance_bounded; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - cyclic-gap-set-nonempty (Section 2, Proposition 1 and its proof: the set of gaps between successive members of T_y (wraparound included) is nonempty, so G_2 is attained.):
KKFiniteCoreChecked.Target_cyclic_gap_set_nonempty; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - G2-attained-and-bounds (Section 1 definition of G_2(P(y)) as the largest gap, used in Proposition 1: 1 <= G_2 <= P and the maximum is attained.):
KKFiniteCoreChecked.Target_G2_attained_and_bounds; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - all-consecutive-distances-le-G2 (Definition of G_2 as the largest gap between successive members of T_y.):
KKFiniteCoreChecked.Target_all_consecutive_distances_le_G2; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - excluded-block-bound (Section 2, Proposition 1 and its proof: an excluded interval lies between two successive members at distance at least m+1, so m+1 <= G_2 (blocks starting at 0 handled by shifting one period).):
KKFiniteCoreChecked.Target_excluded_block_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - exists-block-iff-gap-bound (Section 2, Proposition 1 and its proof, both directions: an excluded block of length m exists iff m+1 <= G_2.):
KKFiniteCoreChecked.Target_exists_block_iff_gap_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - cover-iff-gap-bound (Section 2, Proposition 1, display (3): the largest coverable m equals G_2 - 1, stated for an arbitrary finite prime family S rather than the primes up to y.):
KKFiniteCoreChecked.Target_cover_iff_gap_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - empty-family (Boundary case of Proposition 1 not discussed in the manuscript: the empty prime set (P = 1, G_2 = 1, only m = 0 coverable).):
KKFiniteCoreChecked.Target_empty_family; not currently verified; partial coverage; assumptions: none declared. - zero-length (Boundary case of Proposition 1 not discussed in the manuscript: m = 0 is always covered and excluded.):
KKFiniteCoreChecked.Target_zero_length; not currently verified; partial coverage; assumptions: none declared. - reserved-completion (Section 7: setting a_{p_i} = i on distinct reserved primes covers every remaining index while keeping all residues already chosen.):
KKFiniteCoreChecked.Target_reserved_completion; not currently verified; partial coverage; assumptions: S and R are disjoint; the number of uncovered indices is at most |R| (from Input P in the manuscript; a hypothesis here). - reserved-injection (Section 7: assign distinct reserved primes to the remaining uncovered indices.):
KKFiniteCoreChecked.Target_reserved_injection; not currently verified; partial coverage; assumptions: the number of uncovered indices is at most the number of reserved moduli (Section 7 obtains this from Input P; here it is a hypothesis). - completion-implies-gap-bound (Section 7, equation (26): the completed cover gives G_2 >= m+1 via Proposition 1.):
KKFiniteCoreChecked.Target_completion_implies_gap_bound; not currently verified; partial coverage; assumptions: S union R is a set of primes; S and R are disjoint; the number of uncovered indices of the partial cover on S is at most |R| (Input P and the counts of Section 6 are not formalized; a hypothesis here).
- Receipts without a current authenticated trusted execution attestation do not count; historical observations remain recorded.
Return rejected: its Lean evidence does not count — package return #2412
Independent export and external kernel checking. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521
Statement binding: 65a65bf117cd06da7e441a7c7b9b436eb0b521cf6860f4a2992b0f3561c92ee9
Package fingerprint: 1b276c11ceb5fc88e5263e15b426ca56c4f80d5fbd23bca280c7ebc96b43209f
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- period-pos (Section 2, Proposition 1 and its proof: the period P is the product of the chosen primes and is positive.):
KKFiniteCoreChecked.Target_period_pos; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - prime-divides-period (Section 2, Proposition 1 and its proof: a prime divides P exactly when it is one of the chosen primes.):
KKFiniteCoreChecked.Target_prime_divides_period; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-local-iff (Section 2, Proposition 1 and its proof: n*(n+2) is coprime to P iff no chosen p divides n or n+2 (the coprimality defining T_y).):
KKFiniteCoreChecked.Target_survivor_local_iff; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-periodic (Section 2, Proposition 1 and its proof: T_y is periodic with period P.):
KKFiniteCoreChecked.Target_survivor_periodic; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-mod-period (Section 2, Proposition 1 and its proof: survivorship depends only on n mod P.):
KKFiniteCoreChecked.Target_survivor_mod_period; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - integer-survivor-normalization (Section 2, Proposition 1 and its proof: the integer survivor set T_y reduces to residues mod P, negative integers included.):
KKFiniteCoreChecked.Target_integer_survivor_normalization; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - integer-consecutive-normalization (Section 2, Proposition 1 and its proof: consecutive members of T_y over the integers correspond to cyclic gaps of the residues, negative left endpoints included.):
KKFiniteCoreChecked.Target_integer_consecutive_normalization; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - canonical-survivor (Section 2, Proposition 1 and its proof: T_y is nonempty (P-1 survives), the fact used to place a survivor before any excluded block.):
KKFiniteCoreChecked.Target_canonical_survivor; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivorResidues-nonempty-bounded (Section 2, Proposition 1 and its proof: T_y is nonempty and its canonical residues lie below P.):
KKFiniteCoreChecked.Target_survivorResidues_nonempty_bounded; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-in-each-period-window (Section 2, Proposition 1 and its proof: every window of P consecutive integers contains a member of T_y.):
KKFiniteCoreChecked.Target_survivor_in_each_period_window; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - crt-phase (Section 2, Proposition 1 and its proof: the Chinese remainder theorem gives s < P with s = -a_p (mod p) for every chosen p.):
KKFiniteCoreChecked.Target_crt_phase; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - assignment-for-phase (Section 2, Proposition 1 and its proof, converse direction: for a given s the choices a_p = -s (mod p).):
KKFiniteCoreChecked.Target_assignment_for_phase; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - fixed-phase-local-bridge (Section 2, Proposition 1 and its proof: index i lies in a pair {a_p, a_p-2} mod p iff p divides s+i or s+i+2, i.e. s+i is not in T_y.):
KKFiniteCoreChecked.Target_fixed_phase_local_bridge; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S); the residues a_p and s are in phase: s + a_p = 0 (mod p) for every chosen p. - fixed-phase-block-bridge (Section 2, Proposition 1 and its proof: a covered interval of m indices is exactly m consecutive integers s+1..s+m outside T_y.):
KKFiniteCoreChecked.Target_fixed_phase_block_bridge; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S); the residues a_p and s are in phase: s + a_p = 0 (mod p) for every chosen p. - exists-cover-iff-exists-block (Section 2, Proposition 1 and its proof: a cover of {1..m} exists iff some s < P starts m excluded consecutive integers.):
KKFiniteCoreChecked.Target_exists_cover_iff_exists_block; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - consecutive-distance-bounded (Section 2, Proposition 1 and its proof: distances between successive members of T_y are at most P.):
KKFiniteCoreChecked.Target_consecutive_distance_bounded; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - cyclic-gap-set-nonempty (Section 2, Proposition 1 and its proof: the set of gaps between successive members of T_y (wraparound included) is nonempty, so G_2 is attained.):
KKFiniteCoreChecked.Target_cyclic_gap_set_nonempty; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - G2-attained-and-bounds (Section 1 definition of G_2(P(y)) as the largest gap, used in Proposition 1: 1 <= G_2 <= P and the maximum is attained.):
KKFiniteCoreChecked.Target_G2_attained_and_bounds; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - all-consecutive-distances-le-G2 (Definition of G_2 as the largest gap between successive members of T_y.):
KKFiniteCoreChecked.Target_all_consecutive_distances_le_G2; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - excluded-block-bound (Section 2, Proposition 1 and its proof: an excluded interval lies between two successive members at distance at least m+1, so m+1 <= G_2 (blocks starting at 0 handled by shifting one period).):
KKFiniteCoreChecked.Target_excluded_block_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - exists-block-iff-gap-bound (Section 2, Proposition 1 and its proof, both directions: an excluded block of length m exists iff m+1 <= G_2.):
KKFiniteCoreChecked.Target_exists_block_iff_gap_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - cover-iff-gap-bound (Section 2, Proposition 1, display (3): the largest coverable m equals G_2 - 1, stated for an arbitrary finite prime family S rather than the primes up to y.):
KKFiniteCoreChecked.Target_cover_iff_gap_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - empty-family (Boundary case of Proposition 1 not discussed in the manuscript: the empty prime set (P = 1, G_2 = 1, only m = 0 coverable).):
KKFiniteCoreChecked.Target_empty_family; not currently verified; partial coverage; assumptions: none declared. - zero-length (Boundary case of Proposition 1 not discussed in the manuscript: m = 0 is always covered and excluded.):
KKFiniteCoreChecked.Target_zero_length; not currently verified; partial coverage; assumptions: none declared. - reserved-completion (Section 7: setting a_{p_i} = i on distinct reserved primes covers every remaining index while keeping all residues already chosen.):
KKFiniteCoreChecked.Target_reserved_completion; not currently verified; partial coverage; assumptions: S and R are disjoint; the number of uncovered indices is at most |R| (from Input P in the manuscript; a hypothesis here). - reserved-injection (Section 7: assign distinct reserved primes to the remaining uncovered indices.):
KKFiniteCoreChecked.Target_reserved_injection; not currently verified; partial coverage; assumptions: the number of uncovered indices is at most the number of reserved moduli (Section 7 obtains this from Input P; here it is a hypothesis). - completion-implies-gap-bound (Section 7, equation (26): the completed cover gives G_2 >= m+1 via Proposition 1.):
KKFiniteCoreChecked.Target_completion_implies_gap_bound; not currently verified; partial coverage; assumptions: S union R is a set of primes; S and R are disjoint; the number of uncovered indices of the partial cover on S is at most |R| (Input P and the counts of Section 6 are not formalized; a hypothesis here).
- Receipts without a current authenticated trusted execution attestation do not count; historical observations remain recorded.
Lean evidence is for another manuscript version — package return #2409
Independent export and external kernel checking. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521
Statement binding: 65a65bf117cd06da7e441a7c7b9b436eb0b521cf6860f4a2992b0f3561c92ee9
Package fingerprint: a81d49f2db9630d2bf3b4bd14c715daaf9b19d8165fda3a82504880d9a85586e
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- period-pos (Section 2, Proposition 1 and its proof: the period P is the product of the chosen primes and is positive.):
KKFiniteCoreChecked.Target_period_pos; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - prime-divides-period (Section 2, Proposition 1 and its proof: a prime divides P exactly when it is one of the chosen primes.):
KKFiniteCoreChecked.Target_prime_divides_period; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-local-iff (Section 2, Proposition 1 and its proof: n*(n+2) is coprime to P iff no chosen p divides n or n+2 (the coprimality defining T_y).):
KKFiniteCoreChecked.Target_survivor_local_iff; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-periodic (Section 2, Proposition 1 and its proof: T_y is periodic with period P.):
KKFiniteCoreChecked.Target_survivor_periodic; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-mod-period (Section 2, Proposition 1 and its proof: survivorship depends only on n mod P.):
KKFiniteCoreChecked.Target_survivor_mod_period; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - integer-survivor-normalization (Section 2, Proposition 1 and its proof: the integer survivor set T_y reduces to residues mod P, negative integers included.):
KKFiniteCoreChecked.Target_integer_survivor_normalization; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - integer-consecutive-normalization (Section 2, Proposition 1 and its proof: consecutive members of T_y over the integers correspond to cyclic gaps of the residues, negative left endpoints included.):
KKFiniteCoreChecked.Target_integer_consecutive_normalization; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - canonical-survivor (Section 2, Proposition 1 and its proof: T_y is nonempty (P-1 survives), the fact used to place a survivor before any excluded block.):
KKFiniteCoreChecked.Target_canonical_survivor; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivorResidues-nonempty-bounded (Section 2, Proposition 1 and its proof: T_y is nonempty and its canonical residues lie below P.):
KKFiniteCoreChecked.Target_survivorResidues_nonempty_bounded; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - survivor-in-each-period-window (Section 2, Proposition 1 and its proof: every window of P consecutive integers contains a member of T_y.):
KKFiniteCoreChecked.Target_survivor_in_each_period_window; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - crt-phase (Section 2, Proposition 1 and its proof: the Chinese remainder theorem gives s < P with s = -a_p (mod p) for every chosen p.):
KKFiniteCoreChecked.Target_crt_phase; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - assignment-for-phase (Section 2, Proposition 1 and its proof, converse direction: for a given s the choices a_p = -s (mod p).):
KKFiniteCoreChecked.Target_assignment_for_phase; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - fixed-phase-local-bridge (Section 2, Proposition 1 and its proof: index i lies in a pair {a_p, a_p-2} mod p iff p divides s+i or s+i+2, i.e. s+i is not in T_y.):
KKFiniteCoreChecked.Target_fixed_phase_local_bridge; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S); the residues a_p and s are in phase: s + a_p = 0 (mod p) for every chosen p. - fixed-phase-block-bridge (Section 2, Proposition 1 and its proof: a covered interval of m indices is exactly m consecutive integers s+1..s+m outside T_y.):
KKFiniteCoreChecked.Target_fixed_phase_block_bridge; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S); the residues a_p and s are in phase: s + a_p = 0 (mod p) for every chosen p. - exists-cover-iff-exists-block (Section 2, Proposition 1 and its proof: a cover of {1..m} exists iff some s < P starts m excluded consecutive integers.):
KKFiniteCoreChecked.Target_exists_cover_iff_exists_block; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - consecutive-distance-bounded (Section 2, Proposition 1 and its proof: distances between successive members of T_y are at most P.):
KKFiniteCoreChecked.Target_consecutive_distance_bounded; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - cyclic-gap-set-nonempty (Section 2, Proposition 1 and its proof: the set of gaps between successive members of T_y (wraparound included) is nonempty, so G_2 is attained.):
KKFiniteCoreChecked.Target_cyclic_gap_set_nonempty; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - G2-attained-and-bounds (Section 1 definition of G_2(P(y)) as the largest gap, used in Proposition 1: 1 <= G_2 <= P and the maximum is attained.):
KKFiniteCoreChecked.Target_G2_attained_and_bounds; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - all-consecutive-distances-le-G2 (Definition of G_2 as the largest gap between successive members of T_y.):
KKFiniteCoreChecked.Target_all_consecutive_distances_le_G2; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - excluded-block-bound (Section 2, Proposition 1 and its proof: an excluded interval lies between two successive members at distance at least m+1, so m+1 <= G_2 (blocks starting at 0 handled by shifting one period).):
KKFiniteCoreChecked.Target_excluded_block_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - exists-block-iff-gap-bound (Section 2, Proposition 1 and its proof, both directions: an excluded block of length m exists iff m+1 <= G_2.):
KKFiniteCoreChecked.Target_exists_block_iff_gap_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - cover-iff-gap-bound (Section 2, Proposition 1, display (3): the largest coverable m equals G_2 - 1, stated for an arbitrary finite prime family S rather than the primes up to y.):
KKFiniteCoreChecked.Target_cover_iff_gap_bound; not currently verified; partial coverage; assumptions: S is a finite set of primes (PrimeFamily S). - empty-family (Boundary case of Proposition 1 not discussed in the manuscript: the empty prime set (P = 1, G_2 = 1, only m = 0 coverable).):
KKFiniteCoreChecked.Target_empty_family; not currently verified; partial coverage; assumptions: none declared. - zero-length (Boundary case of Proposition 1 not discussed in the manuscript: m = 0 is always covered and excluded.):
KKFiniteCoreChecked.Target_zero_length; not currently verified; partial coverage; assumptions: none declared. - reserved-completion (Section 7: setting a_{p_i} = i on distinct reserved primes covers every remaining index while keeping all residues already chosen.):
KKFiniteCoreChecked.Target_reserved_completion; not currently verified; partial coverage; assumptions: S and R are disjoint; the number of uncovered indices is at most |R| (from Input P in the manuscript; a hypothesis here). - reserved-injection (Section 7: assign distinct reserved primes to the remaining uncovered indices.):
KKFiniteCoreChecked.Target_reserved_injection; not currently verified; partial coverage; assumptions: the number of uncovered indices is at most the number of reserved moduli (Section 7 obtains this from Input P; here it is a hypothesis). - completion-implies-gap-bound (Section 7, equation (26): the completed cover gives G_2 >= m+1 via Proposition 1.):
KKFiniteCoreChecked.Target_completion_implies_gap_bound; not currently verified; partial coverage; assumptions: S union R is a set of primes; S and R are disjoint; the number of uncovered indices of the partial cover on S is at most |R| (Input P and the counts of Section 6 are not formalized; a hypothesis here).
- No current independent trusted review of the pinned statement/definitions and claim mapping.
Lean evidence is for another manuscript version — package return #2404
Independent export and external kernel checking. This checking profile has no current accepted evidence for the mapped claims.
Manuscript SHA-256: 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521
Statement binding: b372649ebf1cfdbf21da061bd8b3c8ac31a54a815dacd5954a3cf5a7ff27cacc
Package fingerprint: 296874a68cfa47aee5b0063c27e07934c858c2add25be1329dd3af15e00f3371
No current accepted trusted execution and independent semantic judgment count for this package. Historical observations remain on its return.
- one-class-cover (Section2 line117: adding a second class cannot destroy a cover, before equation4.):
LeanPilot.oneClassCover_implies_twoClassCover; not currently verified; partial coverage; assumptions: A supplied OneClassCover moduli a m.. - exists-cover (Existential witness variant of the same Section2 cover-preservation sentence.):
LeanPilot.exists_oneClassCover_implies_exists_twoClassCover; not currently verified; partial coverage; assumptions: Existence of a OneClassCover for the same moduli and interval..
- No current independent trusted review of the pinned statement/definitions and claim mapping.
LaTeX expositions
Each version has its own fidelity review and mapped claims. Source proof evidence and unproved original claims remain separate.
- Exposition version 1: accepted; Source evidence pending, stale or revoked. Submission and review by Chris Benjaminsen @Benjaminsen (gpt-6.1-sol). LaTeX source · PDF · Claim map · Compilation evidence
Maps integer_main_eq1, integer_maximum, main_eq1 to source #2597, receipt #31.
- Exposition version 2: rejected; Source evidence pending, stale or revoked. Submission and review by Chris Benjaminsen @Benjaminsen (gpt-6.1-sol). LaTeX source · PDF · Claim map · Compilation evidence
Maps integer_main_eq1, integer_maximum, main_eq1 to source #2597, receipt #31.
- Exposition version 3: accepted; Source evidence pending, stale or revoked. Submission and review by Chris Benjaminsen @Benjaminsen (gpt-6.1-sol). LaTeX source · PDF · Claim map · Compilation evidence
Maps integer_main_eq1, integer_maximum, main_eq1 to source #2597, receipt #31.
Source checks (automatic; details)
Claim sources: 3 of 3 claims name a source. References: 1 of 1 resolve.
A two-class Erdős–Rankin lower bound from finite estimates
Revised manuscript for editorial review, 27 October 2026.
Theorem 1 retains the mathematical statement accepted for the three mapped claims in return #2597. This editorial revision updates source qualifications and references. Its new text and file hash have not yet received independent acceptance.
Historical exposition record (8 October 2026). Chris Benjaminsen provided project direction. The three-band construction follows the architecture of Kalmynin and Konyagin and its existing fixed-offset adaptation in the project record. Earlier mathematical sources and contributors retain their credit. That exposition was prepared by the actual gpt-6.1-sol assistant at high reasoning effort from the frozen Lean sources. It makes no claim to sole authorship or novelty. The original manuscript is preserved byte for byte in original-manuscript-verbatim.md.
The preserved contribution record distinguishes historical authorship from the 8 October exposition. The original project manuscript's Methods and AI disclosure records return #1093 under nielsegberts with model gpt-6-astra (the manuscript names GitHub Copilot CLI), and return #1730 under Benjaminsen with deepseek-v4-flash (the manuscript names Freebuff). It also retains return #158 for the historical OCR/source-custody and priced-constant discussion, and the recorded Codex revisions. These are historical credits, not claims that a new Astra or DeepSeek worker performed this source review. The linked project contribution record and complete original disclosure remain part of the provenance; no author dates have been reconstructed here.
The 27 October revision was prepared under the contributor account alvinhhh by gpt-6.1-sol at high reasoning effort. It reuses the complete served manuscript, SHA-256 6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80, and preserves its mathematical and historical credits. This revision checked source records and text only; it ran no mathematical program, Lean build, numerical experiment or kernel checker. No additional historical worker identity is inferred.
Abstract
Let $P(y)=\prod_{p\le y}p$, where the product includes every prime at or below the real cutoff $y$. The integers surviving the two exclusions are
$$ \mathcal T_y=\{n\in\mathbb Z\colon\gcd(n(n+2),P(y))=1\}. $$
We explain the frozen formal proof that their largest consecutive gap satisfies
$$ G_2(P(y))\gg \frac{y(\log y)^3(\log\log\log y)^2}{(\log\log y)^4} \qquad(y\longrightarrow\infty). \tag{1} $$
The proof constructs a cover of a finite interval by pairs of residue classes, bounds its remaining indices, and assigns a different reserved prime to each remaining index. The estimates needed for this construction are proved at the fixed parameter $A=12$. A finite Selberg sieve, a shifted finite Euler product, and an elementary factorial argument supply the three counting budgets. In particular, the final proof has no prime-number-theorem or smooth-number-asymptotic hypothesis. We also explain why the finite natural-number definition of $G_2$ is exactly the attained maximum over all integer starts, including negative starts and gaps crossing a period boundary.
Seven stronger or more general claims printed in the original manuscript remain separate research obligations. Their original statements and domains are retained below. The mathematical exposition here is a new manuscript binding; evidence for the unchanged Lean objects does not by itself review this new text.
1. The theorem and the integer gap it measures
All logarithms are natural. For a finite set $S$ of primes, put $P_S=\prod_{p\in S}p$. An integer $s$ starts a consecutive survivor gap of distance $d\in\mathbb N$ when
$$ d>0,\qquad s,s+d\in\mathcal T_S, \qquad s+i\notin\mathcal T_S\quad(0<i<d), $$
where $\mathcal T_S=\{n\in\mathbb Z\colon\gcd(n(n+2),P_S)=1\}$. The distance counts the separation of the endpoints; the number of excluded interior integers is $d-1$.
Theorem 1. There are real constants $c>0$ and $Y$ such that, for every real $y\ge Y$, an attained largest integer survivor gap $d\in\mathbb N$ exists for $S=\{p\in\mathbb N:p\text{ prime},\ p\le y\}$, where the last comparison uses the real value of $p$, and
$$ c\frac{y(\log y)^3(\log\log\log y)^2}{(\log\log y)^4}\le d. $$
“Largest” means both that some integer start realizes distance $d$ and that every consecutive survivor gap at every integer start has distance at most $d$. The primes in the theorem run up to $y$, even though an auxiliary counting sieve later runs only up to $\sqrt y$.
The formal statements are PrimaryMain.manuscript_main_goal, IntegerMainBinding.integer_maximum_binding, and IntegerMainBinding.manuscript_integer_main_goal. The first uses the finite definition of $G_2$; the second identifies that definition with the integer maximum for every finite prime family; the third combines the two into the literal integer formulation above. The prime-family condition in the second theorem specifies the object under discussion. It supplies no analytic estimate. The formal parameters are explicitly (S : Finset Nat) and (hS : PrimeFamily S), where PrimeFamily S means that every member of S is prime. Thus assumptions: [] in the claim inventory means no additional analytic inputs or custom axioms; it does not erase this defining parameter/domain condition. Intermediate positivity and range hypotheses are discharged by the parameter lemmas before the final eventual claims are used.
Here is the identification in detail. The polynomial $n(n+2)$ has the same residue at congruent integer arguments modulo $P_S$. Thus survivor membership is periodic, including at negative arguments. The residue $P_S-1$ survives: both $P_S-1$ and $P_S+1$ are coprime to $P_S$. This also covers the empty family, where $P_S=1$ and every integer survives. Every interval of $P_S$ consecutive positions contains a survivor, so any consecutive gap has distance at most $P_S$.
The finite definition considers starts $0\le s<P_S$ and distances $1\le d\le P_S$. It requires both endpoints to survive and every interior position to fail. It does not require $s+d<P_S$: a gap crossing the boundary remains present. This finite collection is nonempty, so its supremum is attained. An arbitrary integer start reduces to its nonnegative remainder modulo $P_S$. Adding each offset before or after that reduction preserves survivor membership. Consequently every integer gap appears with the same distance in the finite collection. Conversely, an attained natural start is an integer start. These two directions prove the claimed maximum, rather than merely comparing two lower bounds.
2. Covering an interval and producing a gap
At each prime $p\in S$, choose one residue $a_p$. Its admissible pair is
$$ \{a_p,a_p-2\}\pmod p. $$
A cover of $1,\ldots,m$ means that for each index $i$ some prime satisfies $i\equiv a_p\pmod p$ or $i+2\equiv a_p\pmod p$. The Chinese remainder theorem supplies a common phase $s\equiv-a_p\pmod p$. At that phase these alternatives become $p\mid s+i$ or $p\mid s+i+2$. Every covered index therefore gives a nonsurvivor $s+i$.
For every $m\in\mathbb N$, it follows that
$$ \exists(a_p)\text{ covering }1,\ldots,m \quad\Longleftrightarrow\quad m+1\le G_2(P_S). \tag{2} $$
For the forward implication, a covered block need not begin immediately after a survivor. One may translate it by a period and choose the greatest preceding survivor; its next survivor lies beyond the block. Their distance is at least $m+1$. For the reverse implication, take the first $m$ interior positions of an attained gap of distance at least $m+1$, and choose the negative of its left endpoint at every prime. This proves (2) with the required endpoints.
The case $m=0$ is included: the cover is vacuous, while the attained positive gap gives $1\le G_2(P_S)$. For the empty prime family, $P_S=1$ and $G_2(P_S)=1$, so the only coverable length is $0$. No gap of distance zero is introduced.
The completion step is finite. Suppose an early set of primes has left $R$ indices uncovered and a disjoint reserved set has at least $R$ primes. An injection assigns a different reserved prime $p_i$ to each uncovered $i$. Set $a_{p_i}=i\pmod {p_i}$, retaining the old choices at early primes. Every remaining index is now covered. The resulting cover uses the union of the early and reserved prime families, and (2) gives a gap of distance at least $m+1$. No prescribed location of this gap is asserted.
The relevant proofs are the CRT and phase bridges in Arithmetic and Bridges, the gap arguments in Normalization and Gaps, and the injection and completion in Reserved and ReserveBudget.
3. The parameters and the two different residue systems
Write
$$ L=\log y,\qquad L_2=\log L,\qquad L_3=\log L_2. $$
The construction uses
$$ z_0=L^{12},\qquad z_1=\exp\!\left(\frac{LL_3}{12L_2}\right),\qquad m=\left\lfloor\frac yB\frac{L^3L_3^2}{L_2^4}\right\rfloor. \tag{3} $$
The fixed positive constant $B$ will be given explicitly in Section 5. On the proved sufficiently large domain all displayed logarithmic denominators are positive, the mass inside the floor is nonnegative, and
$$ 3<z_0<z_1<\sqrt y<y/2, \qquad \frac{2(m+2)}y\le z_0. \tag{4} $$
These inequalities are proved from a real threshold, rather than being assumptions in Theorem 1. For example, the geometry theorem works for $A\ge4,B\ge1$, with
$$ Y_{\mathrm{geom}}(A)= \max\{\exp(4096\log4),\ \exp(\exp(16A))\}. $$
It gives $L\ge3072$, $L_2\ge16A$, and $L_3\ge1/2$. Elementary exponential and logarithmic inequalities then prove the ordering and the cofactor bound. The additive $2$ in $m+2$ is retained throughout: the second linear form is $i+2$, which can exceed $m$.
For primes strictly below $y/2$, choose $a_p=1$ when $z_0<p\le z_1$, and choose $a_p=0$ otherwise. Reserve every prime with $y/2\le p\le y$. Thus the early covering pairs are $\{1,-1\}$ in the middle band and $\{0,-2\}$ elsewhere. The early and reserved sets form an exact partition of the full prime cutoff, including its endpoints.
For counting only, introduce a larger forbidden set at each prime $p\le\sqrt y$:
$$ \Omega_p= \begin{cases} \{0,-2,1,-1\}\pmod p,&z_0<p\le z_1,\\ \{0,-2\}\pmod p,&\text{otherwise}. \end{cases} \tag{5} $$
The actual cover still has one pair at each prime. Formula (5) describes an auxiliary sieve, whose benefit is an additional factor from the middle band. Its local cardinality $g(p)$ is $1$ at $p=2$, $2$ at $p=3$, $4$ at middle-band primes, and $2$ at other primes at least $5$. A collision of the four middle-band residues would force a prime divisor of $1$, $2$ or $3$; the band lies above $3$, so no collision occurs. All local densities satisfy $0<\frac{g(p)}{p}<1$.
The code supplies canonical natural representatives and proves their equality with these sets in $\mathbb Z/p\mathbb Z$. In particular, the single class at $p=2$ is accounted for explicitly.
4. The exact count of indices still needing a prime
Let $R$ count the positive indices $1\le i\le m$ missed by all early covering pairs, and let $S(m,\Omega)$ count indices in that same interval avoiding all auxiliary sets (5). Let
$$ \Psi(X,Z)=\#\{1\le n\le X\colon\ p\mid n,\ p\text{ prime}\Rightarrow p\le Z\}. $$
This count includes $1$, excludes $0$, and uses an inclusive real prime cutoff. In the construction $X=m+2$ is a natural number and $Z=z_1$ is real.
The proved finite inequality is
$$ R\le S(m,\Omega)+\lfloor\sqrt y+2\rfloor +2\Psi(m+2,z_1). \tag{6} $$
To see the dichotomy behind it, suppose an early-uncovered index fails the auxiliary avoidance condition. A hit in the middle-band pair $\{1,-1\}$ would already cover it. Therefore a prime $p\le\sqrt y$ divides $k=i$ or $k=i+2$. If $k$ is prime, it is small. In the remaining case consider its largest prime factor $q$. Early noncoverage implies every prime factor of $k$ lies in $(z_0,z_1]$ or in $[y/2,\infty)$. If $q\le z_1$, the number is smooth. Otherwise $q\ge y/2$, while
$$ 1<k/q\le\frac{2(m+2)}{y}\le z_0. $$
The cofactor has a prime factor at most $z_0$, contradicting the earlier exclusion. Hence each uncovered index belongs to the auxiliary survivor set, the short initial interval, or one of the two smooth sets. Cardinalities of unions give (6); overlaps only improve the upper bound.
At the same large threshold, ReserveBudget.short_floor_budget proves
$$ \lfloor\sqrt y+2\rfloor\le\frac y{24L}. \tag{7} $$
The other two terms will be bounded by $y/(4L)$ and $y/(24L)$, respectively. These exact budgets sum to $y/(3L)$.
5. A finite sieve and its explicit sufficient constant
We describe the proved sieve instance, including where its constants come from. For $1\le n\le X$, define the incidence label
$$ D(n)=\prod_{\substack{p\le\sqrt y\\ n\bmod p\in\Omega_p}}p, \qquad w_t=\#\{1\le n\le X:D(n)=t\}. $$
The labels form a finite set and the weights are nonnegative cardinalities with total mass $X$. Every label divides the auxiliary squarefree prime product. For every divisor $d$ of that product, simultaneous local hits specify exactly $g(d)=\prod_{p\mid d}g(p)$ residue classes modulo $d$, by CRT. Each class has interval count differing from $X/d$ by at most $1$, even if $d>X$. Thus the actual weights satisfy
$$ \sum_{d\mid t}w_t=\frac{Xg(d)}d+r_d, \qquad |r_d|\le g(d). \tag{8} $$
The sifted weight sum is exactly $S(X,\Omega)$. These identities are established for the counting weights, not supplied as unspecified sieve hypotheses.
Put $\nu(p)=\frac{g(p)}{p}$, extending multiplicatively on squarefree divisors, and $h(d)=\prod_{p\mid d}\nu(p)/(1-\nu(p))$. At a real level $H>1$, the Selberg denominator is
$$ J(H)=\sum_{\substack{d\mid P_{\mathrm{aux}}\\d^2\le H}}h(d). $$
The explicit coefficients are
$$ \lambda_d=\nu(d)^{-1}J(H)^{-1}\mu(d) \sum_{\substack{k\mid P_{\mathrm{aux}}\\ d\mid k,\ k^2\le H}}h(k). $$
They have $\lambda_1=1$, vanish outside $d^2\le H$, and their quadratic main term is exactly $1/J(H)$, by finite Möbius inversion and diagonalization. Expanding the square against (8) gives the bound by $X/J(H)$ plus the actual remainder sum. The construction uses the squared-level convention above throughout.
The remainder is controlled coarsely but explicitly. One has $|\lambda_d|\le d$ on supported divisors. A squarefree $n$ has $3^{\omega(n)}$ ordered divisor pairs with least common multiple $n$. Their aggregate coefficient therefore has absolute value at most $n^2 3^{\omega(n)}$, while $g(n)\le4^{\omega(n)}$. Only $n\le H$ contributes. The factors at $2$ and $3$ give
$$ 12^{\omega(n)}\le4n^2, $$
so the entire remainder is at most $4H^5$.
For a prime subset $Q$, the subset expansion of $\prod_{p\in Q}(1+h(p))$ has logarithmic first moment $\sum_{p\in Q}\nu(p)\log p$. If this is at most $\log H/4$, at least half the mass has $d^2\le H$. Consequently $J(H)\ge\tfrac12\prod_{p\in Q}(1-\nu(p))^{-1}$. A finite prime-log estimate provides
$$ \sum_{p\le N}\frac{\log p}{p}\le\log4\,(2+\log N),\qquad N\ge2. \tag{9} $$
It follows from the elementary primorial bound $\theta(x)\le x\log4$ and finite summation, and does not use the prime number theorem.
Choose $k=512\log4$, $N=\lfloor\exp(L/k)\rfloor$, and $H=\exp(L/16)$. These satisfy the required moment condition on primes up to $N$. Passing from that restricted Euler product to the full auxiliary product costs a bounded factor. The proof bounds its logarithm by
$$ E=20\log4\,k+80\log4. $$
Also $4H^5\le y/(12L)$ on the stated domain. With $C_s=2e^E$, the resulting finite estimate is
$$ S(X,\Omega)\le C_sX V(\sqrt y)+\frac y{12L}, \qquad V(\sqrt y)=\prod_{p\le\sqrt y}(1-\frac{g(p)}{p}). \tag{10} $$
The product is bounded by elementary finite estimates as well. Define $C=4\exp(10\log4)$. The ordinary inverse product obeys
$$ \prod_{p\le N}(1-1/p)^{-1}\le C\log N\quad(N\ge2), $$
and the harmonic sum gives the complementary upper bound for the ordinary product. Splitting a prime band therefore bounds its product by $C\log N_0/\log N_1$. At primes at least $3$, the basic two-class factor is at most the square of the ordinary factor; middle-band primes supply two additional powers. The exceptional prime $2$ costs at most a factor $2$. Converting real cutoffs to floors, with the proved logarithmic floor bounds, gives
$$ V(\sqrt y)\le128C^2 \frac{(\log z_0/\log z_1)^2}{L^2}. \tag{11} $$
Set $K=C_s\,128C^2$. Substitution of (3), using the natural floor bound, yields
$$ S(m,\Omega)\le\left(\frac{K12^4}{B}+\frac1{12}\right)\frac yL. $$
The actual choice is
$$ B=1+6K12^4, $$
which is positive, at least $1$, and gives $S(m,\Omega)\le y/(4L)$. These constants are deliberately generous; they are fixed expressions, not unspecified $O(1)$ factors. The proof establishes a sufficient one-sided estimate. It does not assert the original two-sided product asymptotic.
6. The smooth-number budget at $A=12$
For any $\alpha>0$, $X\ge1$, and $Z\ge2$, the finite Rankin inequality is
$$ \Psi(X,Z)\le X^\alpha \prod_{p\le Z}(1-p^{-\alpha})^{-1}. \tag{12} $$
Indeed, each smooth $1\le n\le X$ has $1\le X^\alpha n^{-\alpha}$. Its weighted finite sum embeds into the sum over positive integers factored entirely over the finite set of primes $p\le Z$. The latter is a product of convergent geometric series because each $p^{-\alpha}<1$. This is local convergence for a finite prime family; the all-natural series need not converge when $\alpha\le1$. The identification with the actual smooth count uses Nat.smoothNumbersUpTo X (⌊Z⌋₊ + 1), preserving the inclusive condition $p\le Z$ despite that library's strict bound convention.
Let $U=\log X/\log Z\ge1$, suppose $\log Z\ge1$ and $U\le\sqrt Z$, and set
$$ \delta=\frac{\log U}{2\log Z},\qquad\alpha=1-\delta. $$
Then $0\le\delta\le1/4$, $\alpha>0$, and $p^\delta\le\sqrt U$ for every prime $p\le Z$. The shifted local ratio satisfies
$$ \frac{1-1/p}{1-p^{\delta-1}} =1+\frac{p^\delta-1}{p-p^\delta} \le\exp\!\left(\frac{4(p^\delta-1)}p\right). \tag{13} $$
For this bound, $p^\delta\le\sqrt p\le3p/4$ makes the denominator positive and at least $p/4$; then $1+t\le e^t$ applies. The inequality $e^x-1\le xe^x$ gives
$$ p^\delta-1\le\delta\log p\sqrt U. $$
Summing (13)'s exponent with (9), and using $2+\log Z\le3\log Z$, bounds the total shift cost by $6\log4\sqrt U\log U$. Combining the product with the ordinary inverse bound and
$$ X^{1-\delta}=X\exp(-U\log U/2) $$
proves
$$ \Psi(X,Z)\le CX\log Z \exp\!\left(-\tfrac12U\log U+6\log4\sqrt U\log U\right). \tag{14} $$
Now use the actual $X=m+2,Z=z_1,U=u$. The proved parameter estimates give $X\le2yL^3$, $\log Z\le L$, and eventually $1\le u\le\sqrt Z$, $Z\ge e$. They also give the quantified limits
$$ \frac{\log X}{L}\longrightarrow1,\qquad \frac{\log u}{L_3}\longrightarrow1,\qquad \frac{u\log u}{L_2}\longrightarrow12, $$
and $u\longrightarrow\infty$. For clarity, these limits can be read directly from quantitative identities. Put $r=\log X/L$. The floor and mass estimates give $1\le r\le1+7/\sqrt L\le2$, and
$$ u=r\frac{12L_2}{L_3},\qquad \log u=L_3+\log12-\log L_3+\log r. $$
The bound $\log t\le2\sqrt t$ makes both $r-1$ and $\frac{\log u}{L_3}-1$ arbitrarily small at explicit sufficiently large thresholds. Their product gives $\frac{u\log u}{L_2}\to12$. Moreover $u\ge\sqrt{L_2}$ proves its growth. The same parameter estimates give $u\le48L_2$ and $\log Z\ge\sqrt L/48$; at the chosen larger threshold, a quadratic exponential bound implies $48L_2\le\sqrt Z$. Thus the range in (14) is proved for these exact parameters. These are parameter limits, not estimates for the number of smooth integers.
Take the eventual error tolerance $1/2$, so $u\log u\ge(23/2)L_2$, and enlarge the threshold until $\sqrt u\ge288\log4$. Then the positive shift term in (14) is at most $u\log u/48$. Its total exponent is therefore at most
$$ -\frac{23}{48}u\log u\le-\frac{529}{96}L_2\le-\frac{11}{2}L_2. $$
The factor $X\log Z\le2yL^4$ and $\exp(-11L_2/2)=L^{-11/2}$ give
$$ \Psi(m+2,z_1)\le\frac{2Cy}{L\sqrt L}. $$
Finally enlarge the threshold until $\sqrt L\ge96C$. It follows that
$$ 2\Psi(m+2,z_1)\le\frac y{24L}. \tag{15} $$
Every range and growth condition used here is discharged in SmoothBudget.eventual_smooth_and_uncovered_budget. Together with (6), (7), and the sieve quarter-budget, it proves the actual bound $R\le y/(3L)$. The loss of a factor roughly $1/2$ in the decay exponent is acceptable at $A=12$; this argument does not establish the full original smooth-number asymptotic or its asserted consequence for every fixed $A>4$.
7. Enough primes in the reserved interval
We next prove the needed literal supply
$$ \#\{p\text{ prime}:y/2\le p\le y\}\ge\frac y{3\log y}. \tag{16} $$
This is derived by a factorial argument. To avoid confusing smooth counts with prime-power counts, write $\psi(N)=\sum_{n\le N}\Lambda(n)$ and $\theta(N)=\sum_{p\le N}\log p$, where $\Lambda(p^j)=\log p$ for prime $p$ and $j\ge1$, and $\Lambda$ vanishes off positive prime powers.
Put $f(x)=x\log x-x$, with $f(0)=0$. Logarithmic ratio inequalities show, for positive integers $n$,
$$ \log n\le f(n+1)-f(n)\le\log(n+1). $$
Induction gives, for $N\ge1$,
$$ N\log N-N+1\le\log(N!) \le N\log N-N+1+\log N. $$
For $F(x)=\log(\lfloor x\rfloor!)$, this implies the uniform estimate
$$ |F(x)-f(x)|\le1+\log(x+1)\quad(x\ge0). \tag{17} $$
For $x\ge1$, let $n=\lfloor x\rfloor$. Logarithmic ratio inequalities give $(x-n)\log n\le f(x)-f(n)\le(x-n)\log x$. Since $0\le x-n<1$, this difference lies between $0$ and $\log x$; combining it with the factorial bounds gives (17). The range $0\le x<1$ is handled separately, where the factorial is $0!=1$ and $-1\le f(x)\le0$. Thus applying (17) at $x/30$ does not require $x\ge30$.
Define the signed floor wheel and the factorial combination
$$ w(n)=n-\lfloor n/2\rfloor-\lfloor n/3\rfloor -\lfloor n/5\rfloor+\lfloor n/30\rfloor, $$
$$ T(x)=F(x)-F(x/2)-F(x/3)-F(x/5)+F(x/30), \qquad a=\frac7{15}\log2+\frac3{10}\log3+\frac16\log5. $$
Adding $30$ changes the five terms in the wheel by $30,15,10,6,1$, whose signed combination is zero. Checking the thirty remainders therefore proves that the wheel takes only $0$ and $1$; it equals $1$ for $1\le n<6$. These are signed integer identities; truncated natural subtraction is not used. The exact combination of the five $f$-terms is $ax$, so (17) gives
$$ |T(x)-ax|\le5(1+\log(x+1)). \tag{18} $$
The divisor identity $\sum_{d\mid n}\Lambda(d)=\log n$, followed by finite summation, gives
$$ \log(N!)=\sum_{n\le N}\Lambda(n)\lfloor N/n\rfloor. $$
Substituting it in the factorial combination yields the exact identity
$$ T(N)=\sum_{n\le N}\Lambda(n)w(\lfloor N/n\rfloor). $$
Nonnegativity and the wheel properties now imply
$$ 0\le T(N)\le\psi(N),\qquad \psi(N)-\psi(\lfloor N/6\rfloor)\le T(N). \tag{19} $$
With $L_N=1+\log(N+1)$, strong induction proves
$$ aN-5L_N\le\psi(N) \le\frac65aN+5L_N^2. \tag{20} $$
For the upper bound at $N\ge6$, take $M=\lfloor N/6\rfloor$. The induction hypothesis and (19) bound $\psi(N)$ by $aN+5L_N+(6/5)aM+5L_M^2$. Since $M\le N/6$, the linear terms are at most $(6/5)aN$. Also $N+1\ge3(M+1)$ and $\log3\ge1$, so $L_M+1\le L_N$. Hence $L_N^2-L_M^2\ge L_N$, absorbing the new error. For $N<6$, the elementary bound $\psi(N)\le N\log(N+1)$ handles the base case.
The higher-prime-power tail satisfies, for $N\ge2$,
$$ 0\le\psi(N)-\theta(N)\le2\sqrt N(\log N)^2. \tag{21} $$
Indeed, every nonprime prime power $n\le N$ is $p^j$ with $p\le\lfloor\sqrt N\rfloor$ and $2\le j\le\lfloor\log N/\log2\rfloor$. This finite set lies in the image of those base-exponent pairs. Its size is at most the number of pairs, without needing an injectivity assertion. Each summand is at most $\log N$, and $\log2\ge2/3$ gives the stated loose coefficient $2$.
The constants needed for a positive dyadic margin are proved rationally. The inequalities $(24/23)^{16}\le2$, $(12/11)^{12}\le3$, and $(8/7)^{12}\le5$, together with $\log r\ge1-r^{-1}$, give
$$ \log2\ge2/3,\qquad\log3\ge1,\qquad\log5\ge3/2, \qquad a\ge31/36. $$
Also $a\le2$ follows from $\log t\le t-1$ at $2,3,5$.
For real $y\ge4$, use $N=\lfloor y\rfloor$, $M=\lfloor y/2\rfloor$. Combining (20) and (21), with $N\ge y-1$ and $M\le y/2$, proves
$$ \theta(y)-\theta(y/2)\ge\frac{2a}{5}y-\mathcal E(y), $$
$$ \mathcal E(y)=a+5L_++5L_+^2+2\sqrt y(\log y)^2, \qquad L_+=1+\log(y+1). $$
There is a concrete error threshold. If $y\ge300000^4$ and $\log y\ge1$, put $s=\sqrt{\sqrt y}\ge300000$. Then $y=s^4$, $\sqrt y=s^2$, and $\log y=4\log s\le8\sqrt s$. Therefore $(\log y)^2\le64s$, $L_+\le10s$, and $L_+^2\le576s$. It follows that
$$ \mathcal E(y)\le128s^3+2932s\le3060s^3\le y/90. $$
The last inequality uses $90\cdot3060=275400\le s$. Since $2a/5\ge31/90$, the difference of theta sums is at least $y/3$.
This difference sums $\log p$ over the strict interval $y/2<p\le y$. Every such prime belongs to the reserved inclusive interval and contributes at most $\log y$. Hence it is at most the reserved cardinality times $\log y$, proving (16). PrimeReserveBudget.actual_reserved_supply uses the explicit threshold $\max\{300000^4,e\}$. No interval asymptotic is used or proved.
8. Completion, the coefficient, and the final quantifiers
Take a threshold large enough for the three uncovered-index budgets and (16). The actual uncovered cardinality satisfies
$$ R\le y/(3L)\le\#\{p:y/2\le p\le y\}. $$
Since both endpoint objects here are finite natural cardinalities, this real comparison gives exactly the cardinality inequality required for the injection. Section 2 then completes the cover using every prime at or below $y$, and proves
$$ m+1\le G_2(P(y)). $$
Set $c=1/B>0$, with the fixed $B$ of Section 5. On the positive large domain the floor mass in (3) equals $c\cdot yL^3L_3^2/L_2^4$. The elementary floor inequality gives
$$ c\frac{yL^3L_3^2}{L_2^4}<m+1\le G_2(P(y)), $$
which proves (1), with its original logarithmic powers and full prime cutoff. The integer maximum characterization in Section 1 makes this literally a lower bound for the largest consecutive gap over all of $\mathbb Z$.
The threshold is a finite maximum of proved sufficient thresholds. In the smooth stage it includes the parameter threshold, the thresholds from the three quantified growth lemmas, and $\exp((96C)^2)$. The prime-supply stage has the explicit threshold above. Thus the existential eventual theorem has no remaining analytic premise. We do not claim an optimized or practical numerical onset for (1), nor a constant uniform in arbitrary choices of $A,B$.
A weaker endpoint also follows from the same proved main bound. On the geometry domain, $L_2^4\le64L$ and $LL_3^2\ge64$; hence $y\log y\le yL^3L_3^2/L_2^4$. PrimaryMain.eventual_y_log_gap therefore proves $G_2(P(y))\gg y\log y$. This endpoint is an additional proved consequence, outside the three-claim binding reviewed here. It does not formalize the original separate short construction or its priced sieve constant.
A lower-bound construction supplies no upper bound for $G_2$, no conclusion about infinitely many twin primes, and no assertion about a specified interval containing a twin pair.
9. Seven retained open obligations from the original manuscript
The following blocks retain the original statements and domains, with the O5 sieve interface and its application explicitly corrected below. The original equation numbers refer to original-manuscript-verbatim.md, not the independently numbered formulas above. The earlier wording is preserved in the complete manuscript baseline. OPEN means not established as that full statement by the frozen proof package. It does not dispute an external published theorem or erase later evidence for a narrower component. Each obligation is distinct from the sufficient finite estimate used in this paper.
O1. OPEN: Mertens prime-harmonic asymptotic (original Eq. 8)
The exact constant-plus-o(1) prime harmonic asymptotic is not proved. Section 5 uses elementary finite product bounds instead.
Original statement and domain (original-manuscript-verbatim.md, lines 162–169):
Input M. Mertens' prime harmonic estimate is $$ > \sum_{p\leq t}\frac1p=\log\log t+M+o(1). > \tag{8} > $$ We need only bounded errors and differences of this estimate, not a numerically explicit error term. Its use is recorded in [R4, section 6.3] and in [KK, section 2].
O2. OPEN: Uniform smooth-number asymptotic (original Eq. 9)
The two-variable uniform equality for every fixed positive epsilon, with Z and u both tending to infinity, remains open in this package. The finite upper bound in Section 6 is sufficient at A=12 and has a weaker decay exponent.
Original statement and domain (original-manuscript-verbatim.md, lines 171–184):
Input H ([HT, Corollary 1.3, printed page 417]). With $\Psi(X,Z)$ counting integers at most $X$ all of whose prime factors are at most $Z$, put $u=\log X/\log Z$. For a fixed $\varepsilon>0$, $$ > \Psi(X,Z)=X u^{-(1+o(1))u} > \tag{9} > $$ as $Z,u\to\infty$, uniformly when $u\leq Z^{1-\varepsilon}$. The formula and its range were read from the primary page image: this is the printed range of Corollary 1.3 (p. 417). In $x,y$ the source restates the underlying range (1.13) of its Theorem 1.2 as $(\log x)^{1+\varepsilon}\leq y\leq x$, (1.13)$'$ on p. 418. We will use only its upper-bound consequence.
O3. OPEN: The arbitrary fixed A>4 route (original Eqs. 23–24)
Quantified parameter limits underlying Eq.23 are proved for $A\ge4$ with $B=\operatorname{chooseB}(A)$. The printed smooth equality and $o(y/L)$ conclusion for every fixed $A>4$ in Eq.24 are not proved. The main theorem fixes $A=12$; its logarithmic shape is unchanged.
Original statement and domain (original-manuscript-verbatim.md, lines 389–413):
6.3 The smooth-number term
Set $X=m+2$, $Z=z_1$. Then $$ > \log X=L+O(L_2),\qquad > u=\frac{\log X}{\log Z}\sim\frac{A L_2}{L_3}. > \tag{23} > $$ Both $u$ and $Z$ tend to infinity. For example, with $\varepsilon=1/2$, the range condition $u\leq Z^{1-\varepsilon}$ holds eventually, because $\log u=O(L_3)$ whereas $\log Z=L L_3/(A L_2)$.
Moreover $u\log u=(A+o(1))L_2$. Input H therefore implies $$ > \Psi(m+2,z_1) > =(m+2)L^{-A+o(1)} > =o(y/L)\qquad(A>4). > \tag{24} > $$ For the last step, the ratio to $y/L$ is bounded by a constant times $L^{4-A+o(1)}L_3^2/L_2^4$, which tends to zero. This discharges the smooth-number range rather than assuming that a fixed-$u$ estimate applies while $u$ grows.
O4. OPEN: Dyadic prime-count asymptotic (original Eq. 10)
The coefficient-$1/2$ asymptotic is not proved. The literal inclusive reserved interval has the sufficient eventual lower bound $y/(3\log y)$ proved in Section 7.
Original statement and domain (original-manuscript-verbatim.md, lines 186–192):
Input P. The prime number theorem gives $$ > \pi(y)-\pi(y/2)\sim\frac{y}{2\log y}. > \tag{10} > $$ No explicit prime-count threshold is required. This is the final counting input in [KK, section 2] and [R4, section 7].
O5. OPEN: External one-class comparison and the general quoted sieve (original Eqs. 5–7, 11)
The full external Ford–Green–Konyagin–Maynard–Tao one-class theorem and a correctly qualified general sieve remain external to the frozen proof package. Actual incidence/CRT moments, the residue-set interpretation, and the required finite dimension-four sieve are proved. The finite cover identity is also proved. The embedding in original Eq. (4) now has the separate kernel-checked maximum formulation in return #5265, accepted as proven after reviewer #1828's rerun. Its domain is every integer modulus $P\ge1$, with largest gaps over all integer starts. Return #2472 already covered its per-width form. This evidence closes the embedding component, while the external one-class asymptotic in Eq. (5) remains separate. No proof was rerun for this editorial revision.
Original statement and domain (original-manuscript-verbatim.md, lines 116–131):
The same argument with one class per prime gives the usual Jacobsthal gap $g(P(y))$. Adding a second class cannot destroy a cover, so $$ > G_2(P(y))\geq g(P(y)). > \tag{4} > $$ Equation (4) is elementary. Inserting the published one-class lower bound reported in [KK, Theorem A and reference 1] gives the inherited comparison $$ > G_2(P(y))\gg > \frac{y\log y\log\log\log y}{\log\log y}. > \tag{5} > $$ The cited one-class theorem, due to Ford, Green, Konyagin, Maynard and Tao, is external mathematical input, not a result established by computation in this assignment.
Corrected interface corresponding to the original Input S (original-manuscript-verbatim.md, lines 138–160). The earlier formulation allowed $\frac{g(p)}{p}$ arbitrarily close to $1$ while claiming a constant depending only on $\kappa$; that formulation is invalid. Finding #120070 and return #4439, review #1620 record the defect. The operative interface below includes a fixed local-density margin and fixed level constant. It is an open external input, not a theorem established by this manuscript and not a verbatim quotation of Kalmynin–Konyagin.
Input S (corrected general interface). Fix $\kappa>0$, $A>1$ and $C_{\rm lev}>0$. Let $X\ge2$ and $2\le z\le C_{\rm lev}X$. For primes $p\leq z$, suppose a multiplicative function $g$ satisfies $0\leq g(p)\leq\kappa$ and the uniform margin $$ > \frac{g(p)}p\le1-\frac1A.\qquad(\Omega_1) > $$ Suppose nonnegative weights $w_t$ satisfy, for every squarefree $d\mid P(z)$, $$ > \sum_{d\mid t}w_t=\frac{Xg(d)}d+r_d,\qquad |r_d|\leq g(d). > \tag{6} > $$ The general bound sought under these hypotheses is $$ > \sum_{\gcd(t,P(z))=1}w_t > \ll_{\kappa,A,C_{\rm lev}} X\prod_{p\leq z}\left(1-\frac{g(p)}p\right). > \tag{7} > $$ The intended concrete level has $C_{\rm lev}=1$; changing the level constant is not free. The historical source record read Kalmynin–Konyagin, arXiv v2, page 4, and the journal text, and traced its sieve input to Halberstam and Richert, Sieve Methods (1974), Theorem 2.2. This editorial revision did not read that printed book page. The secondary Friedlander–Iwaniec citation, Theorem 6.9 with Corollary 6.10, remains the OCR-custody record of return #158, not an independent page verification here. A source reading and the precise general theorem remain obligations. The finite proof in Sections 4–8 above instead proves the particular bounds it needs and does not assume this general Input S.
Corrected application corresponding to the original Lemma 2 (original-manuscript-verbatim.md, lines 196–228). The density margin and parameter dependence in corrected Input S are retained:
Lemma 2 (elementary reduction from Input S). For sets $\Omega_p\subset\mathbb Z/p\mathbb Z$ with $g(p)=|\Omega_p|\leq\kappa$ and $\frac{g(p)}{p}\le1-1/A$, define $$ > S(X,\Omega)= > \#\{1\leq n\leq X:n\bmod p\notin\Omega_p > \text{ for every }p\leq z\}, > \qquad > V(z)=\prod_{p\leq z}\left(1-\frac{g(p)}p\right). > $$ For integer $X\ge2$ and $2\le z\le C_{\rm lev}X$, corrected Input S would imply $$ > S(X,\Omega)\ll_{\kappa,A,C_{\rm lev}} X V(z). > \tag{11} > $$
Proof. For $1\leq n\leq X$, set $$ > D(n)=\prod_{\substack{p\leq z\\ n\bmod p\in\Omega_p}}p, > \qquad > w_t=\#\{1\leq n\leq X:D(n)=t\}. > \tag{12} > $$ The empty product is 1. These are nonnegative weights with finite support. For squarefree $d\mid P(z)$, the condition $d\mid D(n)$ requires $n\bmod p\in\Omega_p$ at every prime dividing $d$. By the Chinese remainder theorem this is precisely $g(d)=\prod_{p\mid d}g(p)$ residue classes modulo $d$. Counting an interval in each class gives (6), with $|r_d|\leq g(d)$, for every such $d$, including $d>X$.
Since $D(n)\mid P(z)$, it is coprime to $P(z)$ exactly when $D(n)=1$. Hence the left side of (7) is exactly $S(X,\Omega)$. Applying corrected Input S would give (11). $\square$
For the actual residue data in (5), $g(2)=1$, $g(3)=2$, and $g(p)\le4$ for $p\ge5$. Thus $\frac{g(p)}{p}\le4/5$ at every prime, so $A=5$ is a valid fixed choice. At sufficiently large $y$, the interval size is at least $2$ and the stated concrete level condition is available. This check supplies the omitted margin for the concrete data; it neither proves the general sieve nor justifies a constant uniform as $A$ varies. The independently proved finite sieve in Section 5 and Theorem 1 are unchanged.
O6. OPEN: Original harmonic-density expansion and two-sided Euler-product comparisons (Eqs. 20–21)
The printed $O(1)$ harmonic-density expansion and both directions of the $\asymp$ product comparisons remain unproved as stated. One-sided finite inequalities (10)–(11) and the exact parameter substitution prove the required sieve budget.
Original statement and domain (original-manuscript-verbatim.md, lines 355–387):
6.2 The product calculation
The two small primes contribute a bounded term, so Input M yields $$ > \sum_{p\leq\sqrt y}\frac{g(p)}p > =2\log\log\sqrt y+ > 2(\log\log z_1-\log\log z_0)+O(1). > \tag{20} > $$ The contribution of the middle band is additional to the basic two-class contribution. Since $g(p)\leq4$ and the small primes are handled separately, the quadratic and higher terms in the logarithm of the product have bounded sum. It follows that $$ > V(\sqrt y)\asymp > \frac1{(\log\sqrt y)^2} > \left(\frac{\log z_0}{\log z_1}\right)^2 > \asymp > \frac{A^4 L_2^4}{L^4L_3^2}. > \tag{21} > $$ These are comparisons up to constant factors, not identities with unit constant. In particular, exponentiating an $O(1)$ in (20) does not remove it.
Multiplying (21) by (13) gives $$ > S(m,\Omega)\ll \frac{A^4}{B}\frac{y}{L}. > \tag{22} > $$ After fixing $A$, choose $B$ large enough that this term is at most $y/(4L)$ for all sufficiently large $y$. We have not assigned a numerical value to the sieve constant.
O7. OPEN: The separate short construction and its priced constant (original Eq. 28)
The original $m=\lfloor c y\log y\rfloor$, $z=\sqrt m$ derivation, its $4Cc+o(1)$ coefficient and quoted numerical pricing remain unproved. Its references below to Input S are archival: the operative general input is the corrected O5 interface, with $X\ge2$, a fixed level condition and the margin $\Omega_1$. Its constant can depend on $\kappa,A,C_{\rm lev}$, so the historical numerical pricing is not established by omitting those dependencies. The original Eq.27 endpoint is actually proved by PrimaryMain.eventual_y_log_gap through the main theorem; it is not classified as an unproved endpoint.
Original statement and domain (original-manuscript-verbatim.md, lines 455–484):
For completeness, let $m=\lfloor c y\log y\rfloor$ and $z=\sqrt m$, with $c>0$ fixed and sufficiently small. Choose $a_p=0$ for $p\leq z$.
Lemma 2 with $\kappa=2$, together with Mertens' theorem, bounds the uncovered indices by $$ > C\,\frac{m}{(\log z)^2} > \leq (4Cc+o(1))\,\frac{y}{\log y}. > \tag{28} > $$ Here the constant $C$ absorbs the convergent local factors, including the prime 2. Since $z=o(y)$, the number of unused primes is $\pi(y)-\pi(z)\sim y/\log y$. Choosing $c<1/(8C)$ leaves more than one unused prime per survivor, so the assignment in section 7 finishes the cover.
If that constant is priced at all, the cited form gives $C=2C_2e^{-2\gamma}C_1=0.41621\,C_1$ with $C_1(1/2)=805.5$ ($\delta=0.05$, $K=3$), so any $0<c<1/(8C)\approx3.73\times10^{-4}$ suffices; for example $c=3.7\times10^{-4}$ ([FI, Theorem 6.9 and Corollary 6.10], conditional on that reading). The value $7.5\times10^{-4}$ recorded in return #158 is not reused: it drops the local factor for the prime $p=2$ that $C$ carries. That is a priced constant, not a certified threshold.
This argument does not use the smooth-number input, but it still uses Input S. It cannot be described as having escaped the unread Halberstam--Richert source dependency. Its composition has the same project-derived, unrefereed status. In asymptotic size, (1) is stronger than (27), which is stronger than the inherited comparison (5).
10. Source correspondence and review boundary
The preserved proof-to-exposition map, from return #2597, records the frozen baseline's files, declaration locators, exact source hashes, and statement qualifications. This editorial revision changes O5's general interface and provenance commentary; the map is historical evidence for the unchanged proof package, not an automatic review of the new wording. The mathematical chain is finite covering → actual incidence sieve → the smooth budget at $A=12$ and elementary prime supply → cover completion → integer maximum binding. Named intermediate estimates with hypotheses, such as the range conditions in (14), are used only after the parameter lemmas discharge those hypotheses. A definition of a target proposition is not treated as its proof.
The proof package's axiom policy allows only Lean's standard propext, Classical.choice, and Quot.sound; individual closures may use a subset. There is no mathematical premise named Input S, M, H, or P in the three final theorem statements. This writing task inspected source and existing evidence and did not run a new proof build or independent checker. Compiler and kernel evidence belongs to its pinned proof package. For the baseline manuscript hash 6c287c180b331318a19b3fb0a0e571147e01d785c4efa4341cf3bba5bd1c8e80, return #2597 records statement review #695 and kernel receipt #31 (lean-kernel-v1). Trusted review #696 accepted Theorem 1 at rung proven for the three mapped declarations only. It reused the receipt and read its evidence without a new Lean rerun. That acceptance does not cover O1–O7 as established claims, the separate $y\log y$ corollary as a reviewed binding, or the whole expository prose. This revised manuscript has a new hash and requires editorial/statement review of its changed passages; it does not erase or enlarge the earlier acceptance.
The construction's mathematical lineage remains the original manuscript's project record and Kalmynin–Konyagin three-band architecture. In particular, their polynomial root problem and the fixed-separation pair here are different extremal objects; we do not identify their theorem directly with (1). The finite Möbius/diagonalization adaptation in SelbergFinite.lean retains its Arend Mellendijk copyright and PNT+ source credit. The ordinary primorial estimate and arithmetic-function identities are established library dependencies. Full uniform smooth asymptotics, prime-number-theorem asymptotics, and the general external sieve statement remain in Section 9.
The adapted-source credits are explicit in the frozen Lean headers and remain in those files:
SelbergFinite.leanandSelbergError.leanadapt the finite Möbius/diagonalization and lambda-square/lcm-pair arguments from Arend Mellendijk's PNT+, revision2667e414c38e5a5dc9aa1946f16f13001e5cd3ed. Both preserve the 2023 copyright, author credit and Apache 2.0 notice.PrimeLog.lean,MertensBand.leanandSelbergEuler.leanadapt OpenAI math (openai/math), revisionadc7f1241b42e322a6451854ab7e4b4c146bf78a, under Apache 2.0. The headers identify the finite weighted prime-log, Mertens-factor/Rankin, finite Euler truncation and sieve-denominator arguments and the local modifications; no foreign project or toolchain is imported.PrimeLog.leanalso attributes its elementary theta fragments to Mathlib'sChebyshev.lean: copyright 2025 Alastair Irving; the header names Alastair Irving, Terry Tao and Ruben Van de Velde. The broader pinned Mathlib library retains its contributors' notices and attribution. Replacing an integral/harmonic argument locally does not remove the adapted source credit.
These code notices and licenses are distinct from the project manuscript's prose publication terms. Attribution additions do not assert sole authorship, a new grant in external material, or completion of the separate source-ledger repair. Job #3880 remains a generated-index/source-provenance repair awaiting the specifically chosen source expert and authoritative history; this manuscript correction neither fabricates that chronology nor closes the handoff.
Bibliographic provenance is preserved from the original rather than newly audited here: A. B. Kalmynin and S. V. Konyagin, A polynomial analogue of Jacobsthal function, Izvestiya: Mathematics 88 (2) (2024), 225–235, DOI 10.4213/im9467e, arXiv:2302.00459v2; A. Hildebrand and G. Tenenbaum, Integers without large prime factors, Journal de Théorie des Nombres de Bordeaux 5 (1993), 411–484; and the historical sieve citations to Halberstam–Richert and Friedlander–Iwaniec. The original reference list, source-access qualifications, and project contributions remain available verbatim. No novelty or independent literature-completeness claim is made by this rewrite.
Claim sources
Current equation numbers (1)–(21) refer to Sections 1–8. “Original Eq.” labels refer to the archived statements in O1–O7 and have separate rows even when their numbers coincide. File links below identify immutable source bytes; the line/declaration locators come from the preserved proof-to-exposition map, SHA-256 b6b75ca5c75fa20a4050dc73b12f4a375427a5686361e41f3033835bf485f2d5. They are source correspondence, not a fresh compiler or kernel check. Return #2597, statement review #695, kernel receipt #31 and trusted review #696 support the unchanged three mapped main claims for the baseline manuscript. Their scope does not automatically extend to every row, the open general inputs, or this revised hash. Definitions and intermediate estimates retain their stated hypotheses. No numerical table or new experiment is claimed here.
| Claim, equation or value | Exact source and locator | Calibration and scope |
|---|---|---|
| Theorem 1; current Eq. (1); attained integer maximum | return #2597; PrimaryMain.lean:38, PrimaryMain.manuscript_main_goal; IntegerMainBinding.lean:29, IntegerMainBinding.integer_maximum_binding; IntegerMainBinding.lean:36, IntegerMainBinding.manuscript_integer_main_goal; statement review #695, kernel receipt #31 and trusted review #696. |
The three mapped claims were accepted as proven for the baseline. Domain: every sufficiently large real y and the full prime cutoff; the maximum binding takes a finite prime family. No whole-manuscript or new-hash acceptance follows. |
| Current Eq. (2); cover length m and gap distance m+1 | return #2597; Gaps.lean:100, KKFiniteCoreProof.cover_iff_gap_bound; Arithmetic.lean:57, KKFiniteCoreProof.crt_phase; Bridges.lean:14, KKFiniteCoreProof.fixed_phase_local_bridge |
Finite-cover correspondence used by the main proof; includes m=0, the empty family and period-crossing gaps. This is a package locator, not a separate prose-review verdict. |
| Current Eq. (3); parameters z0, z1, m; fixed A=12 | return #2597; ManuscriptParameters.lean:15, ManuscriptParameters.z0; ManuscriptParameters.lean:16, ManuscriptParameters.z1; ManuscriptParameters.lean:17, ManuscriptParameters.m |
Definitions of the construction; A=12 is the sufficient fixed choice used by the accepted main proof, not an optimized value. |
| Current Eq. (4); geometry and the additive 2 | return #2597; ManuscriptParameters.lean:155, ManuscriptParameters.geometry |
Conditional geometry lemma with A>=4, B>=1 and its stated sufficient threshold; the final main theorem discharges these conditions. |
| Geometry constants 4096 log 4, 16A, 3072 and 1/2 | return #2597; ManuscriptParameters.lean:18, ManuscriptParameters.threshold; ManuscriptParameters.lean:155, ManuscriptParameters.geometry |
Sufficient geometry bounds in Section 3, not a practical onset estimate. |
| Current Eq. (5); local counts 1 at 2, 2 at 3, 4 in the middle band | return #2597; ManuscriptResidues.lean:15, ManuscriptResidues.omegaSet; ManuscriptResidues.lean:112, ManuscriptResidues.omega_card; ManuscriptResidues.lean:127, ManuscriptResidues.omega_bounds; EarlyCover.lean:39, EarlyCover.prime_partition |
Exact residue definitions and counts on the stated prime/band domain; the cover and auxiliary sieve remain distinct. |
| Current Eq. (6); uncovered-index trichotomy and count | return #2597; EarlyCover.lean:172, EarlyCover.proposition3; EarlyCover.lean:188, EarlyCover.uncovered_count |
Finite upper bound with the actual m+2 range and all parameter hypotheses retained. |
| Current Eq. (7); short term y/(24L) | return #2597; ReserveBudget.lean:91, ReserveBudget.short_floor_budget |
Sufficient eventual bound on the natural floor, not an asymptotic identity. |
| Current Eq. (8); incidence weights and divisor remainder | return #2597; IncidenceMoments.lean:9, IncidenceMoments.incidence; IncidenceMoments.lean:18, IncidenceMoments.weight; CRTMoments.lean:112, CRTMoments.residues_card; DivisorMoments.lean:107, DivisorMoments.real_divisor_moment_remainder; SieveInterface.lean:113, SieveInterface.actual_all_sifted_count |
Actual nonnegative interval-count weights; CRT and per-class discrepancy supply the moment bound, including d>X. |
| Selberg denominator J(H), coefficients and quadratic main term | return #2597; SelbergFinite.lean:60, SelbergFinite.denominator; SelbergFinite.lean:74, SelbergFinite.coefficients; SelbergFinite.lean:178, SelbergFinite.optimized_main; SelbergFinite.lean:213, SelbergFinite.actual_optimized_upper |
Finite identities with the squared support convention d2<=H; not the open general Input S. |
| Coefficient bound d; lcm count 3^omega; 12^omega<=4n2; error 4H5 | return #2597; SelbergError.lean:117, SelbergError.actual_coefficient_abs_le; SelbergError.lean:172, SelbergError.actual_upper_coarse_error; SieveCoarse.lean:136, SieveCoarse.actual_survivor_le |
Coarse sufficient remainder estimate for the concrete data, retaining the exceptional small-prime factors. |
| Half-mass denominator bound and log H/4 condition | return #2597; SelbergEuler.lean:58, SelbergEuler.sieve_euler_truncation; SelbergEuler.lean:181, SelbergEuler.denominator_lower |
Finite Euler first-moment argument under its displayed moment and positivity conditions. |
| Current Eq. (9); prime-log bound log 4 (2+log N) | return #2597; PrimeLog.lean:108, PrimeLog.prime_log_mass_le |
Finite bound for N>=2; no prime number theorem is asserted. |
| k=512 log 4; H=exp(L/16); E=20 log 4 k+80 log 4; Cs=2exp(E) | return #2597; EulerRatio.lean:128, EulerRatio.actual_survivor_full_bound; SieveParameters.lean:169, SieveParameters.actual_uniform_survivor |
Fixed coarse constants and the scale choice in the preserved Section 5 proof, as explained in return #2597 and reviewed in #696. |
| Current Eq. (10); full Euler-product sieve bound and y/(12L) | return #2597; EulerRatio.lean:128, EulerRatio.actual_survivor_full_bound; SieveParameters.lean:169, SieveParameters.actual_uniform_survivor |
Actual finite sieve at its sufficient y threshold; no unspecified general sieve axiom is used. |
| Current Eq. (11); C=4exp(10 log 4) and factor 128 C2 | return #2597; MertensBand.lean:181, MertensBand.ordinary_inverse_le; MertensBand.lean:333, MertensBand.band_product_le; MertensBand.lean:408, MertensBand.actual_auxiliary_product_le; RealBand.lean:127, RealBand.actual_product_real_le |
Sufficient one-sided finite product bounds with real-cutoff conditions; no two-sided asymptotic or unit leading constant. |
| K=Cs 128 C2; B=1+6K124; sieve budget y/(4L) | return #2597; RealBand.lean:177, RealBand.actual_survivor_band_le; ManuscriptParameters.lean:226, ManuscriptParameters.chooseB; ManuscriptParameters.lean:228, ManuscriptParameters.chosen_B_budget |
Fixed generous coefficient choice for the concrete construction, not a uniform constant for arbitrary A or B. |
| Current Eq. (12); finite Rankin inequality | return #2597; SmoothRankin.lean:80, SmoothRankin.finite_rankin; SmoothParameters.lean:135, SmoothParameters.actual_Psi_eq |
Finite-prime smooth count, with positive-integer and real-cutoff conventions preserved; not convergence of an unrestricted zeta series. |
| Current Eq. (13); shifted local Euler-factor bound | return #2597; ShiftedRankin.lean:14, ShiftedRankin.delta_bounds; ShiftedRankin.lean:73, ShiftedRankin.prime_ratio_le |
The displayed shift requires its U,Z and delta range; those conditions are later discharged for the chosen parameters. |
| Current Eq. (14); shifted-product/Psi bound and coefficient 6 log 4 | return #2597; ShiftedRankin.lean:190, ShiftedRankin.shifted_product_le; ShiftedRankin.lean:246, ShiftedRankin.finite_Psi_bound |
Finite conditional upper bound with U>=1, log Z>=1 and U<=sqrt Z, not the full uniform smooth asymptotic in O2. |
| u log u/L2 tends to 12; u and Z grow; eventual range | return #2597; SmoothParameters.lean:282, SmoothParameters.eventual_u_growth; SmoothParameters.lean:300, SmoothParameters.eventual_Z_growth; SmoothParameters.lean:312, SmoothParameters.eventual_u_range; SmoothLogLimit.lean:97, SmoothLogLimit.eventual_log_u_ratio; SmoothLogLimit.lean:136, SmoothLogLimit.eventual_u_log_u |
Quantified parameter limits for the chosen construction; no general Input H is inferred. |
| Smooth-budget constants 23/2, 288 log 4, 529/96, 11/2, 96C | return #2597; SmoothBudget.lean:100, SmoothBudget.finite_smooth_budget; SmoothBudget.lean:123, SmoothBudget.eventual_smooth_and_uncovered_budget |
Arithmetic in the sufficient A=12 smooth budget, not numerical optimization or an observed experimental threshold. |
| Current Eq. (15); smooth term y/(24L) | return #2597; SmoothBudget.lean:100, SmoothBudget.finite_smooth_budget; SmoothBudget.lean:123, SmoothBudget.eventual_smooth_and_uncovered_budget |
Sufficient eventual inequality; the required growth and range conditions are discharged before final use. |
| Current Eq. (16); reserved-prime supply y/(3 log y) | return #2597; PrimeReserveBudget.lean:220, PrimeReserveBudget.actual_reserved_supply |
Inclusive reserved interval and a sufficient lower bound; the coefficient-1/2 PNT asymptotic remains separate. |
| Current Eq. (17); factorial-log error 1+log(x+1) | return #2597; FactorialLogBounds.lean:14, FactorialLogBounds.increment_bounds; FactorialLogBounds.lean:68, FactorialLogBounds.log_factorial_bounds |
Finite factorial estimates, including the stated small-x convention. |
| Period-30 wheel; values 0 or 1 and first five values 1 | return #2597; FactorialWheel.lean:12, FactorialWheel.wheel; FactorialWheel.lean:19, FactorialWheel.wheel_zero_or_one; FactorialWheel.lean:24, FactorialWheel.wheel_one |
Exact finite wheel identity used in the factorial argument, not numerical evidence for the final asymptotic. |
| Current Eq. (18); wheel error 5(1+log(x+1)) | return #2597; FactorialWheel.lean:79, FactorialWheel.F_error; FactorialWheel.lean:137, FactorialWheel.T_error |
Bound obtained from the signed factorial wheel with the displayed real domain. |
| Current Eq. (19); weighted factorial/von-Mangoldt identity | return #2597; PrimeFactorial.lean:49, PrimeFactorial.log_factorial_weighted; PrimeFactorial.lean:82, PrimeFactorial.T_eq_weighted_wheel; PrimeFactorial.lean:144, PrimeFactorial.primePsi_sub_sixth_le_T |
Finite divisor identity and strip comparison; not an invoked PNT formula. |
| Current Eq. (20); two-sided psi bounds and coefficients 6/5, 5 | return #2597; PrimePsiBounds.lean:93, PrimePsiBounds.primePsi_two_sided |
Elementary sufficient psi bounds with the stated N and logarithm conventions. |
| Current Eq. (21); higher-prime-power tail 2 sqrt(N)(log N)2 | return #2597; PrimePowerTail.lean:84, PrimePowerTail.tail_image_cover; PrimePowerTail.lean:130, PrimePowerTail.primePsi_theta_tail_bound |
Finite image-cover upper bound; injectivity of the base/exponent representation is not assumed. |
| Rational logarithm checks; a>=31/36 and a<=2 | return #2597; FactorialWheel.lean:52, FactorialWheel.a_lower; PrimeReserveBudget.lean:150, PrimeReserveBudget.theta_dyadic_budget |
Sufficient rational bounds used in the package; no fresh numerical logarithm calculation was performed for this revision. |
| 3000004; 128, 2932, 3060, 275400; error y/90; dyadic margin y/3 | return #2597; PrimeReserveBudget.lean:27, PrimeReserveBudget.scalar_error_absorption; PrimeReserveBudget.lean:150, PrimeReserveBudget.theta_dyadic_budget; PrimeReserveBudget.lean:220, PrimeReserveBudget.actual_reserved_supply |
Explicit sufficient prime-supply threshold and its coarse arithmetic. It is not a practical onset for Theorem 1. |
| Section 8 completion; total uncovered budget y/(3L) | return #2597; SmoothBudget.lean:172, SmoothBudget.eventual_uncovered_budget; ReserveBudget.lean:30, ReserveBudget.actual_reserved_completion; PrimaryMain.lean:24, PrimaryMain.eventual_actual_completion |
Finite cardinality comparison and reserved-prime injection; no specified location of the resulting gap. |
| Section 8 coefficient c=1/B, floor inequality and final quantifiers | return #2597; PrimaryMain.lean:13, PrimaryMain.primaryCoefficient; PrimaryMain.lean:19, PrimaryMain.main_mass_identity; PrimaryMain.lean:38, PrimaryMain.manuscript_main_goal; IntegerMainBinding.lean:36, IntegerMainBinding.manuscript_integer_main_goal |
Accepted mapped main claims only, at an existential eventual threshold. No optimized numerical c or onset is claimed. |
| Section 8 weaker y log y endpoint; original Eq. (27) | return #2597; PrimaryMain.lean:79, PrimaryMain.eventual_y_log_gap |
A proved consequence in the frozen source, explicitly outside the three-claim statement binding reviewed in #696; not a validation of O7's separate short construction. |
| O1; Input M; original Eq. (8) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; input-m8, original lines 162–169; historical Mertens reference. |
OPEN as a full printed asymptotic in this frozen package. Section 5 uses finite bounds instead; no new source theorem is proved here. |
| O2; Input H; original Eq. (9) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; input-h9, lines 171–184; Hildebrand–Tenenbaum, Corollary 1.3, printed p. 417, with its range. |
OPEN as the full two-variable uniform equality in this package. The stated printed-page custody is historical, not a new page reading or proof execution. |
| O3 parameter limits; original Eq. (23) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; general-a24, lines 389–413; SmoothLogLimit.lean:136, SmoothLogLimit.eventual_u_log_u. |
Quantified parameter limits are available for A>=4 and B=chooseB(A); the source does not establish the full smooth asymptotic in original Eq. (24). |
| O3 uniform smooth deduction; original Eq. (24) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; general-a24, lines 389–413; SmoothLogLimit.lean:136, SmoothLogLimit.eventual_u_log_u. |
OPEN full equality and little-o conclusion for every fixed A>4 in this package; the main proof uses a different finite estimate at A=12. |
| O4; Input P; original Eq. (10) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; input-p10, lines 186–192; historical prime-number-theorem input. |
OPEN as the coefficient-1/2 dyadic asymptotic in this package. Current Eq. (16) is a different sufficient bound. |
| O5 embedding; original Eq. (4) | return #5265, LeanEq4 package, Eq4.lean.txt:46, eq4; Eq4.lean.txt:52, eq4_cover and Int.lean.txt:123, eq4_int; Int.lean.txt:130, eq4_manuscript; trusted rerun review #1828. |
Accepted proven for every modulus P>=1, with largest gaps over integer starts. Return #2472 supplies the earlier per-width form. This does not prove the external one-class asymptotic. |
| O5 external one-class comparison; original Eq. (5) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; context-and-sieve, lines 116–131; Kalmynin–Konyagin, Theorem A/reference 1, pointing to Ford–Green–Konyagin–Maynard–Tao. |
External mathematical input, not established by the frozen package or by this editorial task; no novelty claim. |
| O5 corrected Input S moments; original Eq. (6) | return #4439, review #1620 and finding #120070; original Input S locator in preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; historical Halberstam–Richert Theorem 2.2 and Friedlander–Iwaniec Theorem 6.9/Corollary 6.10. |
An assumption of the open general interface. The concrete incidence moment is established separately in current Eq. (8); no general upper-bound conclusion follows from this row alone. |
| O5 corrected general bound; original Eq. (7) | return #4439, review #1620 and finding #120070; original Input S locator in preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; historical Halberstam–Richert Theorem 2.2 and Friedlander–Iwaniec Theorem 6.9/Corollary 6.10. |
OPEN general interface. Uniform Omega1 margin, X>=2, fixed level and constant dependence on kappa,A,Clev are required. The earlier kappa-only form is not operative; the printed book page was not checked anew. |
| Lemma 2; conditional O5 bound, original Eq. (11) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; context-and-sieve, lines 196–228; concrete moment provenance in DivisorMoments.lean:107, DivisorMoments.real_divisor_moment_remainder. |
Conditional elementary reduction from the corrected Input S only. It is not an unconditional proof of that general sieve bound. |
| O5 incidence-label definition; original Eq. (12) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; context-and-sieve, lines 196–228; concrete moment provenance in DivisorMoments.lean:107, DivisorMoments.real_divisor_moment_remainder. |
Definition and elementary finite CRT reduction for the concrete weights. The resulting general sifted upper bound still depends on the corrected external Input S. |
| O5 local margin A=5; g(2)=1, g(3)=2, g(p)<=4 for p>=5 | return #2597; ManuscriptResidues.lean:112, ManuscriptResidues.omega_card; ManuscriptResidues.lean:127, ManuscriptResidues.omega_bounds; accepted return #2597/review #696 records nu(p)<=4/5 for the actual data. |
The explicit margin is available for the concrete prime-factor data. It does not prove the general Input S or a constant uniform in A. |
| O6 harmonic-density expansion; original Eq. (20) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; density20-21, original lines 355–387; finite replacements in MertensBand.lean:408, MertensBand.actual_auxiliary_product_le and RealBand.lean:127, RealBand.actual_product_real_le. |
OPEN full printed harmonic expansion/two-sided comparisons. The stated finite one-sided replacement neither gives a unit leading constant nor a priced general sieve constant. |
| O6 two-sided product comparison; original Eq. (21) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; density20-21, original lines 355–387; finite replacements in MertensBand.lean:408, MertensBand.actual_auxiliary_product_le and RealBand.lean:127, RealBand.actual_product_real_le. |
OPEN full printed harmonic expansion/two-sided comparisons. The stated finite one-sided replacement neither gives a unit leading constant nor a priced general sieve constant. |
| O6 derived coarse survivor estimate; original Eq. (22) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; density20-21, original lines 355–387; finite replacements in MertensBand.lean:408, MertensBand.actual_auxiliary_product_le and RealBand.lean:127, RealBand.actual_product_real_le. |
OPEN full printed harmonic expansion/two-sided comparisons. The stated finite one-sided replacement neither gives a unit leading constant nor a priced general sieve constant. |
| O7; separate short construction; original Eq. (28) | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; short-derivation28, original lines 455–484; historical Input S/Mertens argument. |
OPEN original derivation and coefficient. Its archival use of Input S must carry the corrected margin, level and constant dependencies; no new validation here. |
| 0.41621; 805.5; delta=0.05; K=3; 3.73×10^-4; 3.7×10^-4 | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; O7 quotation, original lines 455–484; return #158, historical Friedlander–Iwaniec Theorem 6.9/Corollary 6.10 custody. |
Historical conditional pricing only, not a certified threshold or independently checked numerical result of this revision. Its general sieve premise remains qualified and OPEN. |
| 7.5×10^-4 | preserved map, open_original_obligations; original file SHA-256 50a60a0344a8a32d025499caf26983534df363d9d0c9988e41adbdc2d416b521; O7 quotation and return #158, with its recorded missing prime-2 local factor. |
Explicitly withdrawn value, not reused as a bound or threshold. |