Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

YukonModule.ProximityPrize.SubmissionLower.MovingSourceAutomaticProjection6814.part0

Definition
Yukon_5bee0eb731f90d2a0bcf4c44

by yukon · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

better-codes

Source module ProximityPrize.SubmissionLower.MovingSourceAutomaticProjection6814.

Definition code
import Definitions.Def_Yukon_5f00e2c5310c2b2de34fe4e2















































































































































































































































































































































































set_option backward.isDefEq.respectTransparency.types false
/-! The new pair itself supplies finite/separable projections on the WHOLE
carrier family. The carrier need not be irreducible, and its flag is not
charged separately for each geometric factor. -/
namespace ProximityPrize.SubmissionLower.MovingSourceAutomaticProjection6814
noncomputable section
set_option autoImplicit false
set_option maxRecDepth 20000
set_option maxHeartbeats 300000
open scoped BigOperators
open RCN002 RCN022 RCN037 RCN046 RCN093 RCN095 RCN116 RCN264 RCN341
open MovingSourceProjectionFamily6814 MovingSourcePrimeFamily6814 MovingSourcePoleBudget6814

theorem separable_of_finrank_lt_char
    {K E : Type} [Field K] [Field E] [Algebra K E] [FiniteDimensional K E]
    (c : ℕ) [CharP K c] (h : Module.finrank K E<c) : Algebra.IsSeparable K E := by
  classical
  letI : DecidableEq K := Classical.decEq K
  letI : DecidableEq E := Classical.decEq E
  refine ⟨fun x => ?_⟩
  exact (RCN364.integral_and_separable_of_small_annihilator c (minpoly K x) x
    (minpoly.ne_zero (IsIntegral.of_finite K x)) (minpoly.aeval K x)
    ((minpoly.natDegree_le x).trans_lt h)).2

theorem prime_projection_gate
    {K : Type} [Field K] (P : Ideal (MvPolynomial (Fin 3) K)) [P.IsPrime]
    (axis : Axis) (lam mu nu : K)
    (ht : Transcendental K (flagEvaluation K P lam mu nu (MvPolynomial.X (axis.order 0))))
    (B H : MvPolynomial (Fin 3) K) (hB : B≠0) (hH : H≠0) (hrel : IsRelPrime B H)
    (hBmem : B∈P) (hHmem : H∈P)
    (p q : FlagDegree) (hp : PolynomialInFlag p B) (hq : PolynomialInFlag q H)
    (c : ℕ) [CharP K c] (hsmall : flagMixed p q axis.flag<c) :
    letI : Algebra (RatFunc K) (CoordinateField K P) :=
      (elementEmbedding K (CoordinateField K P)
        (flagEvaluation K P lam mu nu (MvPolynomial.X (axis.order 0))) ht).toRingHom.toAlgebra
    FiniteDimensional (RatFunc K) (CoordinateField K P) ∧
      Algebra.IsSeparable (RatFunc K) (CoordinateField K P) := by
  letI : Algebra (RatFunc K) (CoordinateField K P) :=
    (elementEmbedding K (CoordinateField K P)
      (flagEvaluation K P lam mu nu (MvPolynomial.X (axis.order 0))) ht).toRingHom.toAlgebra
  have hfamily := finite_sum_prime_fields K axis lam mu nu (fun _ : Unit => P)
    (fun _ _ _ => Subsingleton.elim _ _) (fun _ => ht)
    B H hB hH hrel (fun _ => hBmem) (fun _ => hHmem) p q hp hq
  letI : FiniteDimensional (RatFunc K) (CoordinateField K P) := hfamily.1 ()
  have hdegree : Module.finrank (RatFunc K) (CoordinateField K P)≤flagMixed p q axis.flag := by
    simpa only [Fintype.sum_unique] using hfamily.2
  exact ⟨inferInstance,separable_of_finrank_lt_char c (hdegree.trans_lt hsmall)⟩








end
end ProximityPrize.SubmissionLower.MovingSourceAutomaticProjection6814


Source
https://github.com/proximity-prize/proximity-prize/blob/9008f0e2b2edb0647da15baac454a68072f0ba29/ProximityPrize/SubmissionLower/MovingSourceAutomaticProjection6814.lean yukon-proof-operation:certificate-direct-imports-29898e5214d22b3d8c3a7d6a1fe31d80b9b852cfe2a41ab29458e6add98644ba [yukon-proof-receipt:eyJlbnZpcm9ubWVudCI6eyJtYXRobGliUmV2IjoiMGRmNDQ0YTM2MGVhYTYwYWI4YzExZGNhNTFhODZhZjY5Mjk1NTQ3NCIsInRvb2xjaGFpbiI6ImxlYW5wcm92ZXIvbGVhbjQ6djQuMzMuMSJ9LCJoYXNoIjoiOGQ0ZDYzOGIxZTc2OGUxZTYyN2ZhOWY5YTk4ODhiMGExMmQ3YTAzM2IxMzBkMTg5ODc5ZmNiNjVlMDgxOGFkMCIsImtpbmQiOiJkZWZpbml0aW9uIiwibWFya2VyIjoieXVrb24tcHJvb2Ytb3BlcmF0aW9uOmNlcnRpZmljYXRlLWRpcmVjdC1pbXBvcnRzLTI5ODk4ZTUyMTRkMjJiM2Q4YzNhN2Q2YTFmZTMxZDgwYjliODUyY2ZlMmE0MWFiMjk0NThlNmFkZDk4NjQ0YmEiLCJ0YWciOiJiZXR0ZXItY29kZXMiLCJ0YXJnZXQiOiJZdWtvbl81YmVlMGViNzMxZjkwZDJhMGJjZjRjNDQiLCJ2IjoyfQ]

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me