The paper asks whether reinforcement learning with verifiable rewards (RLVR) makes task performance less dependent on a prompted persona while also weakening the model's ability to stay in character. It proposes PerMix-RLVR: during GSM8K training, one of 25 personas is sampled uniformly and prepended as a system message while retaining the same GRPO objective and binary verifier as standard RLVR. The controlled comparison starts from Llama-3.1-8B-Instruct and uses QLoRA; it covers SFT, persona-mixed SFT, sequence distillation from three teachers, RLVR, and PerMix-RLVR. Sixteen persona prompts are evaluated with five runs per condition on GSM8K, MATH500, AIME2024, and LiveCodeBench v6. Persona fidelity is measured with PersonaGym, using questions generated by GPT-5-mini and judgments from GPT-5-mini and DeepSeek-v3.2. On MATH500, PerMix-RLVR raises the worst-persona accuracy from 34.0% to 41.0%, lowers the best from 49.6% to 48.6%, and barely changes the mean from 46.8% to 47.1%. PSS, defined as minimum divided by maximum accuracy, rises from 0.675 to 0.818: the advertised +21.2% is a relative improvement in that ratio, not an accuracy gain. On GSM8K, mean accuracy changes from 86.1% to 86.4% and PSS from 0.959 to 0.975. On PersonaGym, Persona Consistency rises from 3.06 to 3.41, producing the abstract's +11.4%; the five-dimension mean only rises from 2.79 to 2.87, and PerMix worsens Action Justification and Toxicity Control. The advantage is not uniform: compared with RLVR, PSS falls from 0.400 to 0.355 on LiveCodeBench Medium; worst, best, mean, and PSS all worsen on AIME24; and every PSS is zero on LiveCodeBench Hard. The method is a simple intervention with a promising lower-tail MATH500 result, but PSS depends on two extremes and can improve by lowering the maximum or even when performance is uniformly poor. Prompts combine identity, style, and problem-solving strategy; although train and test labels are distinct, their semantics overlap substantially. The paper provides no inferential tests for significance claims, human fidelity validation, code, checkpoints, outputs, seeds, or judge logs. Its theory describes an ideal optimum with a style-independent verifier and does not guarantee finite-GRPO or PersonaGym behavior. This is an arXiv v1 preprint, not a confirmed accepted publication.
Research question
Does RLVR reduce the sensitivity of performance to different persona prompts at the cost of expressiveness, and can RLVR training with a mixture of personas simultaneously improve stability on verifiable tasks and fidelity to the persona?