pcy_assumptions
lemmaverified
The three-type instance has strictly increasing types and satisfies the standing assumptions with alpha = 1/2, beta = 2, Assumption 1 and Assumption 2.
Statement
lemma pcy_assumptions :
StrictMono pcy_theta ∧ pcp_is_valid (1 / 2) 2 pcy_theta pcy_mu pcy_cost ∧
pcp_monotone_cost_ratio pcy_theta pcy_cost ∧ pcp_noncompetitive_venue pcy_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.
- pcy_thetaTypes of the three-type instance: theta = (1, 2, 8).
- pcy_muType densities of the three-type instance: (3/10, 1/20, 13/20).
- pcy_costCosts of the three-type instance: venue 0 costs 1 for every type; venue 1 costs 128, 64 and 8.
- Used by 1
- publication_choice_three_types_three_equilibriaA Publication Choice Problem with three strictly ordered types and two venues, alpha = 1/2, beta = 2, satisfying Assumptions 1 and 2, has…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The three-type instance has strictly increasing types and satisfies the standing assumptions with `α = 1/2`, `β = 2`, Assumption 1 (MCR) and Assumption 2 (non-competitive venue 0). -/lemma pcy_assumptions : StrictMono pcy_theta ∧ pcp_is_valid (1 / 2) 2 pcy_theta pcy_mu pcy_cost ∧ pcp_monotone_cost_ratio pcy_theta pcy_cost ∧ pcp_noncompetitive_venue pcy_cost := by refine ⟨?_, ⟨by norm_num, by norm_num, by norm_num, ?_, ?_, ?_, ?_⟩, ?_, ?_⟩ · intro i j h; fin_cases i <;> fin_cases j <;> simp_all [pcy_theta] <;> norm_num · intro i; fin_cases i <;> simp [pcy_mu] · intro i; fin_cases i <;> simp [pcy_theta] · intro i j; fin_cases i <;> fin_cases j <;> simp [pcy_cost] · intro i j j' h; fin_cases i <;> fin_cases j <;> fin_cases j' <;> simp_all [pcy_cost] · intro i i' j j' hθ h fin_cases i <;> fin_cases i' <;> fin_cases j <;> fin_cases j' <;> simp_all [pcy_theta, pcy_cost] <;> norm_num at * · intro i i' j hj have : j = 0 := Fin.ext hj subst this; fin_cases i <;> fin_cases i' <;> simp [pcy_cost]