GI0031

gaussian_natural_scalar_product

Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable

Gaussian multiplication by a natural real scalar is actual coordinatewise natural scaling.

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.

Exact expanded first-order arithmetic statement

forall N e f g h. (((((((((((N) * (e))) + (((0) * (f))))) + (((((0) * (h))) + (((0) * (g))))))) + (((N) * (f)))) = ((((N) * (e))) + (((((((N) * (f))) + (((0) * (e))))) + (((((0) * (g))) + (((0) * (h))))))))) /\ (((((((((N) * (g))) + (((0) * (h))))) + (((((0) * (e))) + (((0) * (f))))))) + (((N) * (h)))) = ((((N) * (g))) + (((((((N) * (h))) + (((0) * (g))))) + (((((0) * (f))) + (((0) * (e)))))))))))

Constructive proof overview

Generated structural guide

Gaussian multiplication by a natural real scalar is actual coordinatewise natural scaling.

The unchanged tactic script uses 2 declared prerequisites and contains 8 exact native proof lines.

Alpha v34 checked-use · first admitted v28 · independently kernel and Lean verified; not Stable

Proof neighborhood

Direct dependencies

mul_zero_left Stable theorem; checked-use authorized zero_add Stable theorem; checked-use authorized

Direct dependents

Formal native tactic body

Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.

Read the argument

Proof checkpoints

8 script commands · 3 reading checkpoints · 0 local claims

This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.

01Fix variables and assumptionsL1–5

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro N
  2. L2
    intro e
  3. L3
    intro f
  4. L4
    intro g
  5. L5
    intro h
02Separate the logical casesL6–6

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L6
    split
03Calculate and transport equalitiesL7–8

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L7
    simp [mul_zero_left, zero_add]
  2. L8
    simp [mul_zero_left, zero_add]

Library-wide reading audit

Original exact command ledger · 8 lines
  1. 0001intro N
  2. 0002intro e
  3. 0003intro f
  4. 0004intro g
  5. 0005intro h
  6. 0006split
  7. 0007simp [mul_zero_left, zero_add]
  8. 0008simp [mul_zero_left, zero_add]