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.
Exact rational replay of the regular amplification constants
Statement
All decimals below are exact rationals. Set , , , , , , for , and for . Set for , and for . The displayed lower bounds for are and those for are . Every later angle exceeds , hence exceeds and . In particular,
The scalar parameter inequalities are , , , , and . The cap comparisons are and . Moreover, . For and for , one has ; also .
Facts & Assumptions
Given: The exact rational constants and recurrences in the Statement. These are scalar inequalities; no graph or stability conclusion is assumed.
Rational sine enclosures from a finite factorial sum gives rational sine enclosures. Rational inverse-sine brackets on the principal branch turns endpoint sine comparisons into principal inverse-sine brackets.
Rational logarithm and pi enclosures after range reduction supplies logarithm and enclosures.
A uniform inverse-sine majorant and geometric angular tail bounds the entire remaining geometric inverse-sine tail.
Proof
Given: The exact rational constants and recurrences in the Statement. These are scalar inequalities; no graph or stability conclusion is assumed.
Goal: Verify the stated numerical inequalities using the cited enclosures.
All interval endpoints below are exact rational numbers. If and , adding endpoint inequalities gives and subtracting gives . For an exact rational scalar , multiplication gives ; for , it gives . If , then , since and . Induction on the finite number of these operations preserves containment, even when an intermediate value is reused. These are all the operations on uncertain quantities used below; divisions in the finite sums, error bounds and scalar constants are exact rational divisions with positive denominators. All resulting rational endpoint comparisons can therefore be checked by clearing positive denominators.
Exact multiplication gives , and ; and . Each exceeds its stated lower bound. In particular and . Do not reset this recurrence at a rounded displayed entry: and . The parameter inequalities in the Statement follow by clearing positive rational denominators; both and are positive, and .
Use in [F1] and [F2]. For inverse sines choose adjacent endpoints on the grid , both in , whose upper sine enclosure at the lower endpoint is below the input and whose lower sine enclosure at the upper endpoint is above it. All following endpoint inequalities are finite rational comparisons using the displayed formulas, so multiplication by their positive factorial and power denominators verifies them exactly. They give , and . For the recurrence, the same procedure gives , , , , and . Thus all five angular lower bounds hold.
The sine bounds [F1] at and give and . Comparing their lower endpoints to after multiplication by , and to , proves both cap comparisons. Clearing the positive denominator proves the degree-600 inequality. For integers , decreases: its difference between successive integers has numerator . Thus the same degree bound holds for all such .
Monotonicity of inverse sine, step 1.2 and [F3] show that all angles from onward are bounded below by the displayed two-inverse-sine expression minus the infinite tail. Here . Substitution of the upper inverse-sine bounds from step 2.1 gives an exact rational lower endpoint greater than ; using the lower bounds gives an upper endpoint less than . The expression therefore exceeds . Earlier angles exceed , so the same lower bound applies to them as well. This bounds an infinite recurrence through a proved remainder, rather than a finite sample.
For , [F2] with bounds the required logarithm by . For , it gives . Substitute each upper endpoint in and clear positive denominators to obtain the two strict inequalities. Exact rational comparison gives . The same decreasing-degree calculation as in step 2.2 extends the latter upper bound to every integer . This verifies that degree bound directly at the larger spectral parameter; it does not infer it from alone.
Depends on
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.