pith. machine review for the scientific record. sign in
lemma proved tactic proof

decodeCoeff_voxelStep_foldMinusOne_encodeIndex

show as:
view Lean formalization →

No prose has been written for this declaration yet. The Lean source and graph data below render without it.

generate prose now

formal statement (Lean)

 337lemma decodeCoeff_voxelStep_foldMinusOne_encodeIndex {N : ℕ} (u : GalerkinState N) (i : (modes N) × Fin 2) :
 338    decodeCoeff (voxelStep foldMinusOneProgram (encodeIndex u i)) = (foldMinusOneDecodedStep u) i := by

proof body

Tactic-mode proof.

 339  classical
 340  -- both sides reduce to the same signed-integer expression
 341  simp [decodeCoeff, foldMinusOneDecodedStep, decodeMag, voxelStep_foldMinusOneProgram, encodeIndex, -clampI32]
 342
 343/-- A concrete, proved decay-step simulation instance (after decoding). -/
 344noncomputable def DecodedSimulationHypothesis.foldMinusOne (N : ℕ) : DecodedSimulationHypothesis N :=
 345  { P := foldMinusOneProgram
 346    step := foldMinusOneDecodedStep
 347    comm := by
 348      intro u
 349      classical
 350      -- Prove equality of Galerkin states by pointwise equality of coefficients.
 351      ext i
 352      -- Reduce to the single-voxel lemma `decodeCoeff_voxelStep_foldMinusOne_encodeIndex`.
 353      simp [decodeGalerkin2D, LNALSemantics.independent, encodeGalerkin2D,
 354        decodeCoeff_voxelStep_foldMinusOne_encodeIndex] }
 355
 356end Simulation2D
 357
 358end IndisputableMonolith.ClassicalBridge.Fluids

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (13)

Lean names referenced from this declaration's body.