sumRange respects pointwise-equal summands

Identifier: F:rat-sumrange-congr
Proof route: kernel-lean
External status: proved
Axiom footprint: Empty

Recorded description

For functions f, g : Nat -> Rat and a natural n: if f(k) = g(k) for every k, then sumRange(f, n) = sumRange(g, n).

Formal statement

theorem Rat.sumRange_congr : ((x0 : ((x0 : AxNat) -> Rat)) -> ((x1 : ((x1 : AxNat) -> Rat)) -> ((x2 : AxNat) -> ((x3 : ((x3 : AxNat) -> Eq.{1} Rat (x0 x3) (x1 x3))) -> Eq.{1} Rat (Rat.sumRange x0 x2) (Rat.sumRange x1 x2)))))

Dependencies

The graph shows direct ledger edges. Follow a node to open its artifact page.

0 direct dependencies 28 direct dependents Graph shows the first 8 on each side.

Evidence

kernel-Rat.sumRange_congr

Kind: kernel-term
Status: checked

Supports: Rat.sumRange_congr is admitted by the trusted kernel gate with the type recorded in formal.statement.

Checker command

cargo run -q --release -p axeyum-lean-kernel --example theorem_dependency_inventory -- Rat.sumRange_congr 2>/dev/null | grep -cE '^Rat\.sumRange_congr[[:space:]]'

Evidence notes

`build_rat_prelude` admits Rat.sumRange_congr through the trusted `Kernel::add_declaration` gate, which re-checks the proof term against the stated type, so a line in this tool's output for the exact name is a machine-checked proof having been admitted. `theorem_dependency_inventory` exits non-zero for a named filter that matches nothing (a deleted theorem cannot read as a re-derived one), and `grep -c` (never `-q`) both avoids a SIGPIPE-under-pipefail false negative and independently asserts the exact tab-anchored line is present. `--release` is MANDATORY: this tool also builds `creal`/`complex`/`cpoint`, which recurse deep enough in a debug build to overflow the default thread stack (measured: release exits 0, debug SIGABRTs at 134) -- the same resource-limit gotcha already documented for `prelude_theorem_inventory --include-constructed`.

footprint-Rat.sumRange_congr

Kind: exhaustive-enumeration
Status: checked

Supports: axiom_footprint: [] -- the rat prelude's trusted surface is empty, which bounds Rat.sumRange_congr

Checker command

cargo run -q -p axeyum-lean-kernel --example nat_axiom_inventory -- --require-axiom-free rat

Evidence notes

`nat_axiom_inventory` builds the Rat environment as its own group and reports `rat: axiom=0 opaque=0 quotient=0 total_trusted=0` (re-measured on this tree). That bounds every individual Rat theorem's footprint by [], including Rat.sumRange_congr, since a theorem cannot depend on a trusted declaration the environment does not contain -- and the enumeration covers Axiom, Opaque AND Quotient, not just Declaration::Axiom, because Opaque has no proof body and Quotient admits Quot.sound. `--require-axiom-free <name>` is an error (not a silent pass/zero) for a prelude this run never built, which is what makes `rat` here a claim rather than an absence.

Provenance

{
  "date": "2026-08-25",
  "established_by": "axeyum-lean-kernel build_rat_prelude",
  "source": "theorem name and dependency edges from theorem_dependency_inventory (builds nat/int/rat/creal/complex/cpoint/string/characterization); canonical type and top-level binder count read via a standalone probe binary depending on axeyum-lean-kernel by path, calling only its public Kernel API (environment(), display_name(), render_lean()) -- no in-tree example prints Rat/CReal theorem types beyond a substring filter; crates/ source was not touched to produce this batch; the probe was built and run in the session scratchpad and deleted after use."
}