Irrationality is equivalent to cofinally many strict-successor divisibility failures.
The equivalence does not prove that the cofinal failures occur.
Is the series sum_{n >= 2} 1/(n! - 1) irrational?
Statements and boundaries are copied from the corpus record. Registry status: not_registered; the claim registry does not carry these declarations and kernel checking them does not promote them into reviewed public claims
Irrationality is equivalent to cofinally many strict-successor divisibility failures.
The equivalence does not prove that the cofinal failures occur.
Irrationality is equivalent to cofinally many non-unit carries.
The equivalence does not supply a cofinal carry producer.
Prove any one of these and the corresponding reduction above becomes unconditional.
weighted_collision_and_complementary_residue On an unbounded family of tailored prime blocks, prove both the weighted collision-core product bound and the independent complementary-residue inequality consumed by the exact unit-factor scale split.cofinal_prime_power_amplification At infinitely many genuinely nonterminal indices, prove quantitative repeated-support valuation amplification strong enough to meet the checked endpoint inequality.cofinal_lower_endpoint_escape For infinitely many primes, force the reduced predecessor gap outside the exact lower unit-carry cylinder.cofinal_doubled_prime_branch_failure For infinitely many odd primes, rule out both exact p^2-divisibility branches at index 2p by coupling the carry value to the predecessor residue.cramer_residual_nonintegrality Construct an unbounded factorial-grid family whose exact Cramer residual is nonintegral, using a determinant, valuation, cancellation, or gcd-of-minors certificate that controls the finite sign-changing block.An exact GMP recurrence checks the carry sequence through m = 300000 and finds a non-unit carry at that index. The Lean consumer turns that one certificate into q >= 300000 for any hypothetical positive rational denominator; it does not prove a cofinal statement.
| Module | Lines | Declarations | Theorems |
|---|---|---|---|
ErdosProblems.Erdos68.FactorialZeroPlateau |
1756 | 63 | 57 |
ErdosProblems.Erdos68.CanonicalFactorialDigits |
278 | 18 | 15 |
ErdosProblems.Erdos68.ChannelBreakpointRigidity |
144 | 10 | 8 |
ErdosProblems.Erdos68.ChannelIntegralCongruence |
1133 | 55 | 46 |
ErdosProblems.Erdos68.DivisorFactorialCentre |
303 | 18 | 13 |
ErdosProblems.Erdos68.EndpointWeightedPrivateSupport |
6674 | 223 | 183 |
ErdosProblems.Erdos68.FactorialCarry |
101 | 8 | 5 |
ErdosProblems.Erdos68.FactorialChannelCertificate |
172 | 17 | 11 |
ErdosProblems.Erdos68.FiniteDefectAutomaton |
120 | 10 | 6 |
ErdosProblems.Erdos68.PrimeUnitTranslator |
1730 | 91 | 70 |
ErdosProblems.Erdos68.PrimeZeroBranch |
7293 | 187 | 155 |
ErdosProblems.Erdos68.StrictSuccessorArithmetic |
204 | 4 | 4 |
The Comparator replays selected exact interfaces against a pinned toolchain. It never widens what Lean proved.
Statement and type parity replayed against the pinned toolchain.
Exact equivalence between irrationality, cofinally many non-unit carries, and cofinal strict-successor divisibility failures.
An exact reformulation does not supply the required cofinal failures.
factorial_carry_characterisation · targeted
Covered through a neighbouring selected interface, not replayed one-to-one.
Finite channel congruences, a two-term prime-channel corrector, and endpoint-weighted projection rigidity.
These finite and structural results do not produce a cofinal obstruction.
factorial_channel_and_projection_rigidity · represented_by_isolated_headline
Stated in the corpus; not part of the replayed interface set.
Cofinal zero-branch or large private-factor hypotheses imply the required irrationality conclusion.
The producer hypotheses are unproved.
factorial_conditional_producers · not_selected_deep_project_predicate_stack
Lean checks small exact misses; a hash-bound GMP scan reaches index 300000 and yields the corresponding finite denominator exclusion.
Finite computation does not change the cofinal quantifier.
factorial_finite_certificates · not_applicable_to_external_execution
A paper deduction gives a lower bound for the lcm of factorial-gap denominators using an external multiplicity theorem.
Comparator cannot certify the cited input or authored deduction.
factorial_lcm_growth · not_applicable_not_a_lean_declaration
Factorial Carries and Finite Channel Obstructions
For the factorial-denominator series, Lean gives an exact factorial-successor normal form and the equivalent eventual-unit-carry criterion, together with integral-channel, prime-translator, projection-rigidity, and Cramer-residual consumers. An independently regenerated exact finite certificate reaches index 300000, and the checked consumer excludes every smaller positive rational denominator. Five quantified producer problems isolate the missing cofinal step; none is proved, and Erdős #68 remains open.