Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata
slug: oeis-a378495-adjacent-difference
bibkey: kagey2024a378495
doi: null
url: https://oeis.org/A378495
triage: theorem
motivation_gids:
  - D5/S3/Zeros/Convolution/PerfectMatchingCount.card_fixedPointFreeInvolution_mul

The literal adjacent difference of OEIS A378495

Problem

OEIS A378495, revision 70, FORMULA, states verbatim:

Conjecture: T(n,n-1) - T(n,n-2) = abs(A238474(n-4)) for n >= 4.

On the source-agreeing columns , counts derangements of having no -cycle; the source explicitly sets . The triangle has offset 1,5. The dependent A238474 entry, revision 15, has offset 0,1 and formula for every natural . This is interpreted in , with rational ordinary subtraction between cast cardinalities and rational division in .

Statement echo

Source clauseExact formal counterpart
Every claim quantifies over every n : Nat with 4 <= n
Actual derangements with no -cycleImported TerminalDifference.T, using permutations of Fin n, no fixed points, and cycle-factor support sizes
Ordinary difference of adjacent columns(T n (n-1) : Q) - (T n (n-2) : Q)
Zero-based A238474b (m : Nat) : Q uses the source factorial quotient
Literal source shift Exactly abs (b (n-4)), with natural subtraction
Universal assertion is falsetheorem result : Not claim, a closed negation of the literal Prop definition

Motivation

The tier-one external question is preregistered separately in #23900. It is Peter Kagey’s revision-59 formula from 2024. Its interpretation depends on Wolfdieter Lang’s 2014 zero-based sequence, whose formula and offset are recorded in the source note. The frozen motivation theorem is a related application of permutation cycle-type cardinalities, not a proof dependency or a substitute result.

Gap

The exact original assertion is refuted by D5.S3.Combinatorics.Derangements.AdjacentDifferenceRefutation.result. The A378495 note records the bounded fixed-pin supplier and literature search. Kallat v1, section 9.2 and supplementary sec:open, leaves this stronger identity outside its proved results. OpenAlex search and Semantic Scholar HTTP 429 gaps preclude a global literature-completeness claim. The counterexample does not require assuming that the formula is novel.

Route

Use . A derangement on five labels cannot have a 4-cycle, since the unused label would be fixed. Thus excluded 5 4 is empty. The actual permutations excluded by a 3-cycle have cycle type and number . The two complementary-count equalities on the same finite set of derangements give . After rational casts, .

The unchanged source shift gives , so the proposed right side is 6. Since and , the universal assertion fails. The proof uses exact cardinality identities, not an assumed triangle formula, an unexplained table, or a search over a finite range.

Falsifier

The equality at five would force . To challenge the refutation’s source fidelity on its relevant columns, one must identify a different source no--cycle convention for or sequence offset; both are fixed explicitly above. The separately disclosed source exception is outside the columns and . Replacing by another shift defines another question and cannot repair the original assertion’s counterexample.

Evidence

The independent scientific terminal is 6510325154. It refutes exactly the original literal statement. Its result statement identity is sha256:38f5f82bc3c0255dc8908fb63b1c0200d69e76147a4b223e00f6ffd41fd925b3. The definition claim has literal compiled type Prop, and result has literal compiled type Not claim. The accepted axiom closure is contained in Classical.choice, Quot.sound, propext. The display formulas use a hand-authored typed Scribe AST of the exact Lean statements; FromLean had no unfrozen fixture entries (missing). No kernel-derived formula projection is claimed. The formula preserves every quantifier, rational cast, natural index subtraction and the literal closed negation of the original claim.

Declaration form, admission and utility

Names below are relative to AdjacentDifferenceRefutation.

Declarationproof_shapeLive consumer or independent question
bdefinition; not applicableclaim, result
claimdefinition; not applicableThe closed negation result
resultbind-onlyThe literal external question preregistered in #23900

There are no new helper theorems and no escape witness. The inline proof uses pinned cycle-type facts, the actual TerminalDifference partition/count suppliers, logical decomposition and exact arithmetic. The admission basis is open-problem-resolution. Utility is certified-instance, with basis=refutes referring to the exact local claim and the designated result. The definitions support that same refutation and introduce no independent positive instance. Generality is I, reflecting the concrete five-label witness.

The result Describe carries the typed Refuted resolution claim for this dossier and names the exact canonical frozen declaration. Its frozen project suppliers are TerminalDifference.noFixed_iff_sum, TerminalDifference.T_add_excluded and TerminalDifference.excluded_penultimate_mul, with their definitions. The designated refutation result is exempt from four-slot registration; b and claim are definitions, not additional audit targets. The nine supplier theorems retain their unfinished section 3.9 audit exception. No Reg registration or declared_validated status is claimed for them.

The separate scientific readings recorded in 6510337040 are , one p5 unit, score coverage 1, mode coverage 1, and zero missing counts. These readings concern this one event; they are not delivery, calibration, research-value or novel-general-discovery credit. The first event’s readings remain unproduced under its unchanged unsupported historical fence, and are not replaced by these values.

Triage

What the settlement shows

  • Proved in Lean: the exact negation of the original universal claim, from the actual five-label difference and absolute sequence value .
  • Computed exactly within the proof: the arithmetic specialization at five and ; no positive finite table establishes a universal law.
  • Mechanism: a 4-cycle leaves a fixed point, whereas cycle type has twenty realizations. The zero offset fixes the comparison to .
  • Open: a corrected shift, restricted-range replacement or neighboring identity is not established here. In particular no replacement is claimed proved.
  • Unaffected: the separate original terminal formula has its own proof dossier. No failure of Kallat’s other results or of the whole paper is inferred.
  • Boundary: remote required CI and final independent integration review remain pending; no delivery or KPI is claimed from the scientific settlement or readout.

ASSUMED-UNVERIFIED

Global novelty, priority and literature completeness are unestablished, including the named rate-limited search endpoints. Historical producer times are recorded assertions with unchanged server evidence, not newly recovered process telemetry. Pre-mathematics full native closure ordering remains unestablished. The supplier’s audit is unfinished and the first event’s readings are unproduced. No final CI, integration or delivery completion is asserted.