Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A fixed finite modified Hamiltonian is close to the original energy

Statement

For a fixed N≥r and compact K⋐U, let Hh[N]=H+∑j=rNhjHj be the finite modified Hamiltonian constructed in A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain. Define Mj=0 if K=∅, and otherwise Mj:=max⁡z∈K∣Hj(z)∣. Put C0:=∑j=rNMj. Then C0 is finite and nonnegative, and for 0<h≤1, ∣Hh[N](z)−H(z)∣≤C0hr(z∈K). The least nonnegative upper bound for these pointwise errors is also at most C0hr. If K≠∅, this is exactly sup⁡z∈K∣Hh[N](z)−H(z)∣≤C0hr,C0=∑j=rNsup⁡z∈K∣Hj(z)∣. If K=∅, the pointwise assertion is vacuous and its least nonnegative upper bound is 0=C0; no real supremum of an empty set is used.

Facts & Assumptions

Given: A fixed finite truncation and compact K⋐U.

[F1]

The coefficients Hj are smooth on U and the modified Hamiltonian is the finite polynomial H+∑j=rNhjHj. A finite formal logarithm has Hamiltonian coefficients on a star-shaped domain

[F2]

A continuous real-valued function on a nonempty compact metric space attains a finite maximum, equal to its real supremum. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

Proof

technique · separate the empty set and bound the finite coefficient sum
1.1F1F2givenalgebra

If K=∅, every Mj=0 and hence C0=0. The pointwise estimate has no instances, and every nonnegative real is a uniform upper bound for the empty error family, so its least such bound is 0. Assume henceforth K≠∅. By [F1], every Hj is continuous; [F2] applied to ∣Hj∣ gives its finite nonnegative maximum Mj on K, equal to the corresponding supremum. Their finite sum C0 is therefore finite and nonnegative.

2.1F1F2step 1.1givenalgebra∎

For z∈K, [F1] and step 1.1 give ∣Hh[N](z)−H(z)∣≤∑j=rNhjMj≤hr∑j=rNMj=C0hr for 0<h≤1, since every j≥r has hj≤hr. The error function is continuous on nonempty compact K, so [F2] also gives its attained maximum and ordinary real supremum, both bounded by this same right-hand side. Its nonnegative maximum is its least nonnegative upper bound. Together with the empty branch in step 1.1, this proves every stated case without an empty real supremum.

Depends on

Used by

Dependency tree · two levels

34 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources