{"schema_version":"ocme-site-results-v1","locale":"zh-Hant","page_type":"derivations","facts":{"questions":36000,"reviewed":36000,"display_candidates":0,"knowledge":302,"guides":299,"paths":59,"batches":360,"families":1441,"atlas":302,"core":80,"evidence":9,"formal_evidence":5,"formal_subjects":4,"lean_files":6,"lean_toolchain":"leanprover/lean4:v4.30.0","question_state":"candidate","english_state":"ai_candidate","question_Lean":"NOT_RUN","canonical_truth_promotion":false},"filters":{"q":"mko-lagrange-multiplier-condition"},"kind":"guides","total":1,"pages":1,"page":1,"entries":[{"id":"derivation-mko-lagrange-multiplier-condition-01","title":{"zh-Hant":"正則乘數與完整平方距離解","en":"Regular multipliers and a complete squared-distance solution"},"summary":{"zh-Hant":"minimize ‖x-(1,2)‖^2 subject to x_1+x_2=0，求點、乘數並獨立證最小。","en":"Minimize the squared distance to (1,2) subject to x_1+x_2=0; find the point and multiplier and independently prove the minimum."},"mko_ids":["mko-lagrange-multiplier-condition"]}],"title":"概念推導導讀"}