Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

L2 normalisation of the sine modes on an interval

Statement

Assume Countable Choice. For all integers k,l≥1, ∫0πsin⁡(kx)sin⁡(lx) dx=π2 δkl. In particular ∥sin⁡(k⋅)∥L2(0,π)=π/2.

Facts & Assumptions

Given: Countable Choice and integers k,l≥1, and the trigonometric functions of the power-series definition.

[A1]

Countable Choice is the ambient hypothesis inherited through the L² inner-product dictionary [F5] (The Axiom of Countable Choice (ACω)).

[F1]

Angle addition: sin⁡(x+y)=sin⁡xcos⁡y+cos⁡xsin⁡y and cos⁡(x+y)=cos⁡xcos⁡y−sin⁡xsin⁡y (The addition formulas for sine and cosine).

[F2]

sin⁡′=cos⁡ and cos⁡′=−sin⁡, with sin⁡0=0 (The derivatives of sine and cosine are cosine and minus sine).

[F3]

sin⁡x=0 exactly for x=mπ, m∈Z (The zero sets of sine and cosine and the least positive common period 2 pi).

[F4]

On an order-convex I with at least two elements, a continuous function has primitives, and for a<b in I and any primitive G one has ∫abf=G(b)−G(a) (Every continuous function on an interval has a primitive; two primitives differ by a constant; and ∫abf=G(b)−G(a) for any primitive G).

[F5]

L2(0,π) is the quotient space of The space Lp(μ) as the quotient by null functions, and under its Countable Choice hypothesis the integral pairing of L2 with the integral pairing is a Hilbert space satisfies ⟨f,f⟩=∥f∥L2(0,π)2=∫0π∣f∣2; Countable Choice is inherited from that supplier (The Axiom of Countable Choice (ACω)).

Proof

Given: Countable Choice and integers k,l≥1.

1.1F1given

Combining the two addition formulas [F1] gives the product-to-sum identity 2sin⁡(kx)sin⁡(lx)=cos⁡((k−l)x)−cos⁡((k+l)x) for all real x; when k=l it reads 2sin⁡2(kx)=1−cos⁡(2kx), which is the same identity with cos⁡(0)=1.

2.1step 1.1F2F3F4F6given

For every nonzero integer m the function x↦sin⁡(mx)/m is a primitive of x↦cos⁡(mx) on [0,π] by [F2] and [F6], so the evaluation clause of [F4] ([F3] for the vanishing of sine at the endpoints) gives ∫0πcos⁡(mx) dx=sin⁡(mπ)−sin⁡0m=0; also ∫0π1 dx=π.

3.1step 1.1step 2.1given

If k≠l then both k−l and k+l are nonzero integers, so step 2.1 and step 1.1 give ∫0πsin⁡(kx)sin⁡(lx) dx=12(0−0)=0; if k=l then k−l=0 and k+l=2k≠0, so ∫0πsin⁡(kx)2dx=12(π−0)=π2. Hence the displayed identity holds for all integers k,l≥1.

4.1step 3.1A1F5given∎

Taking k=l and using the inner-product dictionary [F5] gives ∥sin⁡(k⋅)∥L2(0,π)2=∫0πsin⁡(kx)2dx=π2 and hence ∥sin⁡(k⋅)∥L2(0,π)=π/2. The integral computation of steps 1.1–3.1 is choice-free; the only use of Countable Choice is the inheritance through [F5] in this last step, needed to read the quotient norm as the integral pairing.

Depends on

Used by

Dependency tree · two levels

60 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