AFTD Auto-Formalizing Theoretical Domains

pcx_assumptions

lemmaverified

The binary instance satisfies the standing assumptions with alpha = 1/2, beta = 2, Assumption 1 (MCR) and Assumption 2 (non-competitive venue).

Statement

lemma pcx_assumptions :
    pcp_is_valid (1 / 2) 2 pcx_theta pcx_mu pcx_cost ∧ pcp_monotone_cost_ratio pcx_theta pcx_cost ∧
      pcp_noncompetitive_venue pcx_cost
Source
step towards publication_choice_three_equilibria / publication_choice_three_types_three_equilibria (The Publication Choice Problem, AAAI 2026 (arXiv:2511.13678v2), Theorem 4.1 and Conjecture 4.2)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
  • pcp_is_validStanding assumptions of a Publication Choice Problem: alpha in (0,1), beta > 1, positive type densities, types and costs, and costs…
  • pcp_monotone_cost_ratioAssumption 1 (Monotone Cost Ratio): for types theta_i < theta_i' and venues j < j', c_ij / c_i'j < c_ij' / c_i'j'.
  • pcp_noncompetitive_venueAssumption 2 (non-competitive venue): the least competitive venue has the same publication cost for every type.
  • pcx_thetaTypes of the binary instance: theta = (1, 8).
  • pcx_muType densities of the binary instance: (1/3, 2/3).
  • pcx_costCosts of the binary instance: venue 0 costs 1 for both types; venue 1 costs 128 for the low type and 8 for the high type.
Used by 2
  • pcx_equilibrium_of_rootEvery positive root x of pcx_poly gives a pure-strategy equilibrium of the binary instance with impacts pcx_impact x, in which every type…
  • publication_choice_three_equilibriaA binary-type Publication Choice Problem with two venues, alpha = 1/2, beta = 2, satisfying Assumptions 1 and 2, has three pure-strategy…

Lean source view module on GitHub

/-- The instance satisfies the standing assumptions with `α = 1/2`, `β = 2`, together with Assumption 1 (MCR) and Assumption 2 (non-competitive venue 0). -/lemma pcx_assumptions :    pcp_is_valid (1 / 2) 2 pcx_theta pcx_mu pcx_cost ∧ pcp_monotone_cost_ratio pcx_theta pcx_cost ∧      pcp_noncompetitive_venue pcx_cost := by  refine ⟨⟨by norm_num, by norm_num, by norm_num, ?_, ?_, ?_, ?_⟩, ?_, ?_⟩  · intro i; fin_cases i <;> simp [pcx_mu]  · intro i; fin_cases i <;> simp [pcx_theta]  · intro i j; fin_cases i <;> fin_cases j <;> simp [pcx_cost]  · intro i j j' h; fin_cases i <;> fin_cases j <;> fin_cases j' <;> simp_all [pcx_cost]  · intro i i' j j' hθ h    fin_cases i <;> fin_cases i' <;> fin_cases j <;> fin_cases j' <;> simp_all [pcx_theta, pcx_cost]; norm_num  · intro i i' j hj    have : j = 0 := Fin.ext hj    subst this; fin_cases i <;> fin_cases i' <;> simp [pcx_cost]
See it in the graphDiscuss this resultChallenge it