theorem
proved
multiplicative
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Algebra.CostAlgebra on GitHub at line 774.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
comp -
cost_algebra_unique_aczel -
CostMorphism -
CostMorphism -
CostMorphism -
eq_id_of_map_two_eq_two -
equivZModTwo -
H_at_one -
J -
J_defect_form -
J_at_phi -
PhiInt -
PhiInt -
PhiInt -
PhiInt -
phi_ring_certificate -
CostAlgHomKappa -
CostAlgPlusHom -
initial_morphism_exists -
powerMap_pos -
p_neq_np_conditional -
H_from_phi -
H_PhiMultiplicative -
additiveQuadratic -
dot_sq_le_sqNorm_mul -
oncologyLatticeCert -
OncologyLatticeCert -
perTurn_ratio -
back -
Normalization -
H_of -
bilinear_family_forced -
bilinear_family_reduction -
RCL_unique_polynomial_form -
IsNormalizedCost -
complete_forcing_chain -
J_computes_P -
CostAlphaLog -
ComparisonOperator -
ExcludedMiddle
formal source
771instance : CoeFun JAut (fun _ => PosReal → PosReal) := ⟨fun f => f.1⟩
772
773/-- Multiplicativity of a `J`-automorphism. -/
774theorem multiplicative (f : JAut) (x y : PosReal) :
775 f (posMul x y) = posMul (f x) (f y) :=
776 f.2.1 x y
777
778/-- Cost preservation of a `J`-automorphism. -/
779theorem preserves_cost (f : JAut) (x : PosReal) :
780 J (f x).1 = J x.1 :=
781 f.2.2 x
782
783@[ext] theorem ext {f g : JAut} (h : ∀ x : PosReal, f x = g x) : f = g := by
784 apply Subtype.ext
785 funext x
786 exact h x
787
788/-- The identity automorphism. -/
789def id : JAut :=
790 ⟨fun x => x, by
791 constructor
792 · intro _ _
793 rfl
794 · intro _
795 rfl⟩
796
797/-- The reciprocal automorphism. -/
798noncomputable def reciprocal : JAut :=
799 ⟨posInv, by
800 constructor
801 · intro x y
802 apply Subtype.ext
803 simp [posMul, posInv, mul_comm]
804 · intro x