Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-02
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.

Euler's formula: exp⁡(iθ)=cos⁡θ+isin⁡θ for every real θ

Statement

For every real θ, exp⁡(iθ)=cos⁡θ+isin⁡θ.

Facts & Assumptions

Given: A real θ.

[L1]

The complex exponential by its power series defines exp⁡z as the sum of the complex series with terms zn/n!, where the factorial is embedded in the complex field.

[L2]

The complex exponential series converges absolutely for every complex argument states that for every z∈C, the series ∑zn/n! converges absolutely.

[L3]
[L4]

Every absolutely convergent complex series converges, and rearrangements preserve its sum states that every absolutely convergent complex series converges.

[L6]

Convergent series add and scale termwise states that convergent real series add and scale termwise, with the corresponding sums.

[L8]

Sine and cosine defined by their real power series defines sine and cosine by the real series ∑k=0∞(−1)kθ2k+1/(2k+1)! and ∑k=0∞(−1)kθ2k/(2k)!.

[L9]

Integer powers in the complex field defines natural complex powers by z0=1 and zn+1=znz.

Proof

technique · direct
1.1

Put an=(iθ)n/n!, and define the parity masks by en=an for even n and en=0 for odd n, while on=0 for even n and on=an for odd n. By [L1] and [L2], ∑an converges absolutely and has sum exp⁡(iθ).

L1L2construct
1.2

Induction from i2=−1 and the recursion in [L9] gives i2k=(−1)k and i2k+1=i(−1)k for every k∈N. Hence e2k=(−1)kθ2k/(2k)!, e2k+1=0, o2k=0, and o2k+1=i(−1)kθ2k+1/(2k+1)!.

L9algebra
2.1

Since 0≤∣en∣≤∣an∣ and 0≤∣on∣≤∣an∣, [L3] shows that both modulus series converge. Thus ∑en and ∑on are absolutely convergent and hence converge by [L4].

L3L4step 1.1
3.1

By [L5], the two coordinate series of e and o converge. Since an=en+on, applying [L6] in each coordinate gives ∑n=0∞an=∑n=0∞en+∑n=0∞on.

L5L6step 2.1
3.2

Apply [L7] to each real coordinate series of e, with consecutive blocks [2k,2k+2). By step 1.2 the real-coordinate blocks are (−1)kθ2k/(2k)! and the imaginary-coordinate blocks are 0. Therefore [L8] identifies ∑en=cos⁡θ.

L5L7L8step 2.1step 1.2
3.3

Apply the same coordinatewise grouping to o. Its real-coordinate blocks are 0 and its imaginary-coordinate blocks are (−1)kθ2k+1/(2k+1)!, so [L8] gives ∑on=isin⁡θ.

L5L7L8step 2.1step 1.2
4.1

Substitute steps 3.2 and 3.3 into step 3.1 and use step 1.1: exp⁡(iθ)=cos⁡θ+isin⁡θ.

step 1.1step 3.1step 3.2step 3.3∎

Depends on

Used by

Dependency tree · two levels

52 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